#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int inf=0x3f3f3f3f;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int n,x,y,ans=inf;

int main()

{

    int now,nowf;

    n=read();

    for(int i=;i<=;i++){

        x=read(); y=read();

        if(n%x) now=n/x+;

        else now=n/x;

        nowf=now*y;

        ans=min(ans,nowf);

    }

    printf("%d\n",ans);

    return ;

}

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int n;

int f[][]={{,,,,,,,,,,,,},{,,,,,,,,,,,,}};

int nx,ny,nz,tail=,ans;

struct node{int x,y,z;}q[M];

int pd(int x){

    if(x%) return ;

    if(x%==){

        if(x%==) return ;

        return ;

    }

    return ;

}

int check(int x){

    int sx=q[x].x,sy=q[x].y,sz=q[x].z; //printf("%04d%02d%02d\n",sx,sy,sz);

    return (sx!=nx||sy!=ny||sz!=nz);

}

void add(int k){

    int x=q[k].x,y=q[k].y,z=q[k].z+;

    int now=pd(x);

    if(f[now][y]<z) z=,y++;

    if(y>) y=,x++;

    tail++;

    q[tail].x=x; q[tail].y=y; q[tail].z=z;

}

int okay(int x){

    int ans=q[x].x*+q[x].y*+q[x].z; //printf("%d\n",ans);

    int s[];

    for(int i=;i<=;i++) s[i]=ans%,ans=ans/;

    return s[]==s[]&&s[]==s[]&&s[]==s[]&&s[]==s[];

}

int main()

{

    n=read(); q[tail].x=n/; q[tail].y=n/%; q[tail].z=n%;

    //printf("[%d %d %d]\n",q[1].x,q[1].y,q[1].z);

    n=read(); nx=n/; ny=n/%; nz=n%;

    if(okay(tail)) ans++;

    while(check(tail)){

        add(tail);

        if(okay(tail)) ans++;

    }

    printf("%d\n",ans);

    return ;

}

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=,mx=;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int sum[M];

struct node{int t,w;}q[*M];

int head,tail,n,last,k,x,tot;

int main()

{

    n=read();

    for(int i=;i<=n;i++){

        last=read(); k=read();

        for(int i=;i<=k;i++){

            x=read();

            if(!sum[x]) tot++;

            sum[x]++;

            q[tail].t=last; q[tail++].w=x;

        }

        while(q[head].t+mx<=last&&head<tail){

            int now=q[head++].w;

            sum[now]--;

            if(!sum[now]) tot--;

        }

        printf("%d\n",tot);

    }

    return ;

}

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=,maxN=;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int sum,xa,xb,xc,xd;

int n,m,id[M],w[maxN];

int a[maxN],b[maxN],c[maxN],d[maxN];

int main()

{

    n=read(); m=read();

    for(int i=;i<=m;i++) id[i]=read(),w[id[i]]++;

    for(int i=;i<=n/;i++){

        int now=i*;

        sum=;

        for(xa=n-now-;xa;xa--){

            xb=xa+*i; xc=xb+*i+; xd=xc+i;

            sum+=w[xc]*w[xd];

            a[xa]+=w[xb]*sum;

            b[xb]+=w[xa]*sum;

        }

        sum=;

        for(xd=now+;xd<=n;xd++){

            xc=xd-i; xb=xc-*i-; xa=xb-*i;

            sum+=w[xa]*w[xb];

            c[xc]+=sum*w[xd];

            d[xd]+=sum*w[xc];

        }

    }

    for(int i=;i<=m;i++) printf("%d %d %d %d\n",a[id[i]],b[id[i]],c[id[i]],d[id[i]]);

    return ;

}