A sweet little monster Om Nom loves candies very much. One day he found himself in a rather tricky situation that required him to think a bit in order to enjoy candies the most. Would you succeed with the same task if you were on his place?  One day, when he came to his friend Evan, Om Nom didn't find him at home but he found two bags with candies. The first was full of blue candies and the second bag was full of red candies. Om Nom knows that each red candy weighs Wr grams and each blue candy weighs Wb grams. Eating a single red candy gives Om Nom Hr joy units and eating a single blue candy gives Om Nom Hb joy units.Candies are the most important thing in the world, but on the other hand overeating is not good. Om Nom knows if he eats more than C grams of candies, he will get sick. Om Nom thinks that it isn't proper to leave candy leftovers, so he can only eat a whole candy. Om Nom is a great mathematician and he quickly determined how many candies of what type he should eat in order to get the maximum number of joy units. Can you repeat his achievement? You can assume that each bag contains more candies that Om Nom can eat.

The single line contains five integers C, Hr, Hb, Wr, Wb (1 ≤ C, Hr, Hb, Wr, Wb ≤ 109).

Print a single integer — the maximum number of joy units that Om Nom can get.

NoteIn the sample test Om Nom can eat two candies of each type and thus get 16 joy units.

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define uint unsigned int
#define uchar unsigned int
uint get_nums(unsigned long ans[], char *str);

// {}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
int main(void) {
char str[57];
fgets(str,57,stdin);
unsigned long buf[5];
get_nums(buf,str);

#define C buf[0]
#define Hr buf[1]
#define Hb buf[2]
#define Wr buf[3]
#define Wb buf[4]

unsigned long long ans=0;
const unsigned long long z= C/Wr;

for ( unsigned long long n1=z; (n1>0)&(z-n1<=100000); n1-- )
{
	unsigned long long tmp = n1*Hr + Hb*(( C - n1*Wr)/Wb);
	if ( tmp > ans) ans=tmp;
}

const unsigned long long z2= C/Wb;
for ( unsigned long long n1=z2; (n1>0)&(z2-n1<=100000); n1-- )
{
        unsigned long long tmp = n1*Hb + Hr*(( C - n1*Wb)/Wr);
        if ( tmp > ans) ans=tmp;
}

	printf("%I64u",ans);
	return 0;
}

// =======================================
//========================================
// =======================================
unsigned int get_nums(unsigned long ans[], char *str)
{
int i=0;
int p=0;
unsigned int n=0;
char tmp[64];
if (str[0]==0) return 0;

while( i<=strlen(str) )
	{
	if ((str[i]==32)|(i==strlen(str))) {
			tmp[p]=0;
			ans[n]=atoi(tmp);
			//printf("%d ",ans[n]);
			n++;
			p=0;
			}
	tmp[p]=str[i];
	p++;
	i++;
	}
return n;
} // =========================================

#include<stdio.h>
#include<conio.h>
int main()
{
    long long int e,a,b,c,d,i,j,m=0,n=0,rem=0,max=-100000000,f;
    scanf("%lld %lld %lld %lld %lld",&e,&a,&b,&c,&d);
    double r=(double)a/(double)c;
    double k=(double)b/(double)d;
    //printf("%lf %lf\n",r,k);
    if(r>2*k&&e>=c){
        m=e/c;
        printf("%lld",m*a);
    }
    else if(k>2*r && e>=d){
        n=e/d;
        printf("%lld",n*b);
    }
    else if(a==b && c==d){
         printf("%lld",(e/c)*a);
    }
    else if(r>k){
        m=e/c;
        //printf("%lld\n",m);
        if(m==0){
            printf("%lld",(e/d)*b);
            return 0;
        }
        rem=e%c;
        n=rem/d;
        if(e%c==0){
            m=e/c;
            max=m*a;
        }
        else{
           while(m!=-1 && rem<=e){
                n=rem/d;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%d==0)break;
                if(rem<d){
                    if((d-rem)%c==0){
                        m=m-(d-rem)/c;
                        rem=rem+(d-rem);
                    }
                    else {
                         m=m-(d-rem)/c-1;
                         rem=rem+((d-rem)/c+1)*c;
                    }
                    continue;
                }
                rem=rem+c;
                m--;
            }
        }
        printf("%lld",max);
    }
    else{
        n=e/d;
        if(n==0){
            printf("%lld",(e/c)*a);
            return 0;
        }
        rem=e%d;
        m=rem/c;
        if(e%d==0){
            n=e/d;
            max=n*b;
        }
        else{
            while(n!=-1 && rem<=e){
                m=rem/c;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%c==0)break;
                if(rem<c){
                    if((c-rem)%d==0){
                        n-=(c-rem)/d;
                        rem+=(c-rem);
                    }
                    else {
                         n-=(c-rem)/d+1;
                         rem+=((c-rem)/d+1)*d;
                    }
                    continue;
                }
                n--;
                rem=rem+d;
            }
        }
        printf("%lld",max);
    }
    return 0;
    //getch();
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c, wr, wb;
    long long hr, hb;
    long long ans;

    scanf("%d %lld %lld %d %d", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    for (i = 0; i <= c / wr && i * i <= c; i++)
        ans = max(ans, hr * i + (c - wr * i) / wb * hb);
    for (i = 0; i <= c / wb && i * i <= c; i++)
        ans = max(ans, hb * i + (c - wb * i) / wr * hr);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    long long ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) > 10000)
        if (wr > wb)
            for (i = 0; c - wr * i >= 0; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; c - wb * i >= 0; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; c - wr * i >= 0 && i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    long long ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) * max(wr, wb) > c)
        if (wr > wb)
            for (i = 0; c - wr * i >= 0; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; c - wb * i >= 0; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; c - wr * i >= 0 && i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    long long ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) > 10000)
        if (wr > wb)
            for (i = 0; wr * i <= c; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; wb * i <= c; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; c - wr * i >= 0 && i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>
#include <math.h>

void swap(long long *a, long long *b)
{
    long long t = *a; *a = *b; *b = t;
}

int main()
{
    long long c, hr, hb, wr, wb;
    scanf("%I64d%I64d%I64d%I64d%I64d", &c, &hr, &hb, &wr, &wb);

    long long sqrtc = sqrt(c), cntbmax;
    if (wr >= sqrtc || wb >= sqrtc) {
        if (wr > wb) {
            swap(&hr, &hb);
            swap(&wr, &wb);
        }
        // Guaranteed that wr <= sqrt(c) <= wb
        cntbmax = c / wb;
    } else {
        if (hb * wr > hr * wb) {
            swap(&hr, &hb);
            swap(&wr, &wb);
        }
        // Guaranteed that hb * wr <= wb * hr
        cntbmax = wr - 1;
    }

    long long ans = 0, cntb;
    for (cntb = 0; cntb <= cntbmax; ++cntb) {
        long long cur = cntb * hb + (c - cntb * wb) / wr * hr;
        if (cur > ans) ans = cur;
    }

    printf("%I64d\n", ans);
    return 0;
}

#include <math.h>
#include <stdio.h>

int main() {
	int c, hr, hb, wr, wb, sq;
	long long max, r, b;

	scanf("%d%d%d%d%d", &c, &hr, &hb, &wr, &wb);
	if (hr * wb > hb * wr) {
		int tmp;

		tmp = hr, hr = hb, hb = tmp;
		tmp = wr, wr = wb, wb = tmp;
	}
	sq = sqrt(c), max = 0;
	if (wb > sq)
		for (b = 0; b * wb <= c; b++) {
			r = (c - b * wb) / wr;
			if (max < r * hr + b * hb)
				max = r * hr + b * hb;
		}
	else
		for (r = 0; r < wb && r * wr <= c; r++) {
			b = (c - r * wr) / wb;
			if (max < r * hr + b * hb)
				max = r * hr + b * hb;
		}
	printf("%lld\n", max);
	return 0;
}

#include<stdio.h>
#define LEVEL 1
int main(){
	long long int i,c,hr,hb,wr,wb,tmp,happy,max,happybase,num;
	scanf("%lld %lld %lld %lld %lld",&c,&hr,&hb,&wr,&wb);
	happybase=0;
	if(c>(wr*wb*(LEVEL+1))){
		num=(c/(wr*wb))-LEVEL;
		if((hr*wb)>=(hb*wr)){
			happybase=(hr*wb)*num;
		}else{
			happybase=(hb*wr)*num;
		}
		c-=(wr*wb)*num;
	}
	max=0;
	if(wr>=wb){
		for(i=0;(wr*i)<=c;i++){
			tmp=c-(wr*i);
			happy=(tmp/wb)*hb;
			happy+=(hr*i);
			if(max<happy){
				max=happy;
			}
		}
	}else{
		for(i=0;(wb*i)<=c;i++){
			tmp=c-(wb*i);
			happy=(tmp/wr)*hr;
			happy+=(hb*i);
			if(max<happy){
				max=happy;
			}
		}
	}
	printf("%lld",happybase+max);
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
    long long int c,hr,hb,wr,wb,happy=0,qr,qb,ans=0,temp;
    int i,j;
    scanf("%I64d",&c);
    scanf("%I64d",&hr);
    scanf("%I64d",&hb);
    scanf("%I64d",&wr);
    scanf("%I64d",&wb);
    if(wr>=sqrt(c))
    {
        for(i=0;i<=c/wr;i++)
        {
            temp=i*hr+((c-i*wr)/wb)*hb;
            //printf("temp:%I64d\n",temp);
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wb>=sqrt(c))
    {
        for(i=0;i<=c/wb;i++)
        {
            temp=i*hb+((c-i*wb)/wr)*hr;
            //printf("temp:%I64d\n",temp);
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wr<sqrt(c) && wb<sqrt(c))
    {
        if(hr*wb<=hb*wr)
        {
            for(i=0;i<=wb;i++)
            {
                temp=i*hr+((c-i*wr)/wb)*hb;
                if(temp>ans)
                    ans=temp;
            }
        }
        else
        {
            for(i=0;i<=wr;i++)
            {
                temp=i*hb+((c-i*wb)/wr)*hr;
                if(temp>ans)
                    ans=temp;
            }
        }
    }
    printf("%I64d\n",ans);
    return 0;
}

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int main(){
long long c,Hr,Hb,Wr,Wb,rez;
scanf("%lld %lld %lld %lld %lld\n",&c,&Hr,&Hb,&Wr,&Wb);
//printf("%lld %lld %lld %lld %lld\n",c,Hr,Hb,Wr,Wb);

	long long i;
	long long tempV;
	rez = 0;
		for(i=0; i*i<=c; i++){

			if(i*Wr <= c){
				tempV = i*Hr + ((c-i*Wr)/Wb)*Hb;

				if(rez < tempV)rez=tempV;
			}
	}

		for(i=0; i*i<=c; i++){
			if(i*Wb <= c){
				tempV = i*Hb + ((c-i*Wb)/Wr)*Hr;
				if(rez < tempV)rez=tempV;
			}
		}

	printf("%lld\n",rez);

return 0;

}

#include<stdio.h>

long long int a,b,c,d;
long long int n,m,max=0;

int main()
{
	scanf("%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d);
	long long int val,i,j,k;
	for(i=n/d;i>=0 && n/d-i<=100000;i--)
	{
		val=((n-d*i)/c)*a+i*b;
		if(val>max)
			max=val;
	}
	for(i=n/c;i>=0 && n/c-i<=100000;i--)
	{
		val=i*a+((n-c*i)/d)*b;
		if(val>max)
			max=val;
	}
	printf("%lld\n", max);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int c,h1,h2,w1,w2;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
	long long int now1=0,now2=0,curenjoy=0,maxenjoy=0;
	if(w1>=sqrt(c))
	{
//		printf("1\n");
	for(now1=0;now1<=c/w1;now1++)
	{
		now2=(c-now1*w1)/w2;
	//	if(now2==0)
	//		now1=c/w1
//		printf("%lld %lld\n",now1,now2);
		curenjoy=(h1*now1)+(h2*now2);
		if(curenjoy>maxenjoy)
			maxenjoy=curenjoy;
	}
	}

	else if(w2>=sqrt(c))
	{
//		printf("2\n");
		for(now2=0;now2<=c/w2;now2++)
		{
			now1=(c-now2*w2)/w1;
	//		if(now1==0)
	//			now2=c/w2;
//		printf("%lld %lld\n",now1,now2);

			curenjoy=h1*now1+h2*now2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}
	else if(h1*w2>=h2*w1)
	{
//		printf("3\n");
		for(now2=0;now2<=w1;now2++)
		{
			now1=(c-now2*w2)/w1;
			curenjoy=h1*now1+h2*now2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}
	else
	{
//		printf("4\n");
	for(now1=0;now1<=w2;now1++)
	{
		now2=(c-now1*w1)/w2;
	//	if(now2==0)
	//		now1=c/w1
//		printf("%lld %lld\n",now1,now2);
		curenjoy=(h1*now1)+(h2*now2);
		if(curenjoy>maxenjoy)
			maxenjoy=curenjoy;
	}
	}

	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>

#define max(a,b) (a>b)?(a):(b)

int main(void){
    long long int  C,Hr,Hb,Wr,Wb;
    long long int ans = 0;
    int i;

   scanf("%lld %lld %lld %lld %lld",&C,&Hr,&Hb,&Wr,&Wb);

    for(i=0;i<1000000;i++)
		if(Wr * i <= C)
			ans = max(ans, Hr * i + (C - Wr * i) / Wb * Hb);

    for(i=0;i<1000000;i++)
		if(Wb * i <= C)
			ans = max(ans, Hb * i + (C - Wb * i) / Wr * Hr);

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

    return 0;
}

#include <stdio.h>

long long max(long long max1,long long max2)
{
    if(max1>max2)
        return max1;
    else
        return max2;
}
int main()
{
    long long int ans=0,c,jr,jb,wr,wb,red,blue,max1=0,max2=0,x=0,y=0;
    scanf("%I64d %I64d %I64d %I64d %I64d",&c,&jr,&jb,&wr,&wb);
    while(x<1000000)
    {
        if(x*wr<=c)
        {
            max1=x*jr + ((c-x*wr)/wb)*jb;
        }
        if(y*wb<=c)
        {
            max2=y*jb + ((c-y*wb)/wr)*jr;
        }
        //printf("max1:%d max2:%d\n",max1,max2);
        if(max(max1,max2)>ans)
            ans=max(max1,max2);
        x++;
        y++;
    }
    printf("%I64d",ans);
    return 0;
}

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define uint unsigned int
#define uchar unsigned int

uint get_nums(unsigned long ans[], char *str);

// {}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
int main(void) {
char str[57];
fgets(str,57,stdin);
unsigned long buf[5];
get_nums(buf,str);

#define C buf[0]
#define Hr buf[1]
#define Hb buf[2]
#define Wr buf[3]
#define Wb buf[4]

unsigned long long ans=0;
const unsigned long long z= C/Wr;

for ( unsigned long long n1=z; (n1>=0)&(z-n1<=100000); n1-- )
{
	unsigned long long tmp = n1*Hr + Hb*(( C - n1*Wr)/Wb);
	if ( tmp > ans) ans=tmp;
}

//printf("2\n");
const unsigned long long z2= C/Wb;
for ( unsigned long long n1=z2; (n1>=0)&(z2-n1<=100000); n1-- )
{
        unsigned long long tmp = n1*Hb + Hr*(( C - n1*Wb)/Wr);
        if ( tmp > ans) ans=tmp;
}

	printf("%I64d",ans);
	return 0;
}

// =======================================
//========================================
// =======================================
unsigned int get_nums(unsigned long ans[], char *str)
{
int i=0;
int p=0;
unsigned int n=0;
char tmp[64];
if (str[0]==0) return 0;

while( i<=strlen(str) )
	{
	if ((str[i]==32)|(i==strlen(str))) {
			tmp[p]=0;
			ans[n]=atoi(tmp);
			//printf("%d ",ans[n]);
			n++;
			p=0;
			}
	tmp[p]=str[i];
	p++;
	i++;
	}
return n;
} // =========================================

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define uint unsigned int
#define uchar unsigned int

uint get_nums(uint ans[], char *str);

// {}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
int main(void) {
char str[57];
fgets(str,57,stdin);
uint buf[5];
get_nums(buf,str);
//printf("-----\nC=%d\nHr=%d	Wr=%d\nHb=%d	Wb=%d\n--------\n",buf[0],buf[1],buf[3],buf[2],buf[4]);
#define C buf[0]
#define Hr buf[1]
#define Hb buf[2]
#define Wr buf[3]
#define Wb buf[4]

uint W1,W2,H1,H2;
if (Wr>Wb) {W1=Wr; H1=Hr; W2=Wb; H2=Hb;} else {W2=Wr; H2=Hr; W1=Wb; H1=Hb;}

unsigned long long ans=0;
const unsigned long z= C/W1;

for ( unsigned long n1=0; n1<z; n1++ )
{
	unsigned long long tmp = n1*H1 + H2*(( C - n1*W1)/W2);
	if ( tmp > ans) ans=tmp;
}

	printf("%I64u",ans);
	return 0;
}

// =======================================
//========================================
// =======================================
unsigned int get_nums(uint ans[], char *str)
{
int i=0;
int p=0;
unsigned int n=0;
char tmp[64];
if (str[0]==0) return 0;

while( i<=strlen(str) )
	{
	if ((str[i]==32)|(i==strlen(str))) {
			tmp[p]=0;
			ans[n]=atoi(tmp);
			//printf("%d ",ans[n]);
			n++;
			p=0;
			}
	tmp[p]=str[i];
	p++;
	i++;
	}
return n;
} // =========================================

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define uint unsigned int
#define uchar unsigned int

uint get_nums(unsigned long ans[], char *str);

// {}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
int main(void) {
char str[57];
fgets(str,57,stdin);
unsigned long buf[5];
get_nums(buf,str);
//printf("-----\nC=%d\nHr=%d	Wr=%d\nHb=%d	Wb=%d\n--------\n",buf[0],buf[1],buf[3],buf[2],buf[4]);
#define C buf[0]
#define Hr buf[1]
#define Hb buf[2]
#define Wr buf[3]
#define Wb buf[4]

//unsigned long W1,W2,H1,H2;
//if (Wr>Wb) {W1=Wr; H1=Hr; W2=Wb; H2=Hb;} else {W2=Wr; H2=Hr; W1=Wb; H1=Hb;}

unsigned long long ans=0;
const unsigned long long z= C/Wr;

for ( unsigned long long n1=0; (n1<z)&(n1<100000); n1++ )
{
	unsigned long long tmp = n1*Hr + Hb*(( C - n1*Wr)/Wb);
	if ( tmp > ans) ans=tmp;
}

const unsigned long long z2= C/Wb;

for ( unsigned long long n1=0; (n1<z2)&(n1<100000); n1++ )
{
        unsigned long long tmp = n1*Hb + Hr*(( C - n1*Wb)/Wr);
        if ( tmp > ans) ans=tmp;
}

	printf("%I64d",ans);
	return 0;
}

// =======================================
//========================================
// =======================================
unsigned int get_nums(unsigned long ans[], char *str)
{
int i=0;
int p=0;
unsigned int n=0;
char tmp[64];
if (str[0]==0) return 0;

while( i<=strlen(str) )
	{
	if ((str[i]==32)|(i==strlen(str))) {
			tmp[p]=0;
			ans[n]=atoi(tmp);
			//printf("%d ",ans[n]);
			n++;
			p=0;
			}
	tmp[p]=str[i];
	p++;
	i++;
	}
return n;
} // =========================================

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define uint unsigned int
#define uchar unsigned int

uint get_nums(uint ans[], char *str);

// {}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}{}
int main(void) {
char str[57];
fgets(str,57,stdin);
uint buf[5];
get_nums(buf,str);
//printf("-----\nC=%d\nHr=%d	Wr=%d\nHb=%d	Wb=%d\n--------\n",buf[0],buf[1],buf[3],buf[2],buf[4]);
#define C buf[0]
#define Hr buf[1]
#define Hb buf[2]
#define Wr buf[3]
#define Wb buf[4]

uint W1,W2,H1,H2;
if (Wr>Wb) {W1=Wr; H1=Hr; W2=Wb; H2=Hb;} else {W2=Wr; H2=Hr; W1=Wb; H1=Hb;}

long uint ans=0;
const long uint z= C/W1;

for ( long uint n1=0; n1<z; n1++ )
{
	long uint tmp = n1*H1 + H2*(( C - n1*W1)/W2);
	if ( tmp > ans) ans=tmp;
}

	printf("%lu",ans);
	return 0;
}

// =======================================
//========================================
// =======================================
unsigned int get_nums(uint ans[], char *str)
{
int i=0;
int p=0;
unsigned int n=0;
char tmp[64];
if (str[0]==0) return 0;

while( i<=strlen(str) )
	{
	if ((str[i]==32)|(i==strlen(str))) {
			tmp[p]=0;
			ans[n]=atoi(tmp);
			//printf("%d ",ans[n]);
			n++;
			p=0;
			}
	tmp[p]=str[i];
	p++;
	i++;
	}
return n;
} // =========================================

#include<stdio.h>
#include<conio.h>
int main()
{
    long long int e,a,b,c,d,i,j,m=0,n=0,rem=0,max=-100000000,f,w;
    scanf("%lld %lld %lld %lld %lld",&e,&a,&b,&c,&d);
    double r=(double)a/(double)c;
    double k=(double)b/(double)d;
    if(r>2*k){
        m=e/c;
        printf("%lld",m*a);
    }
    else if(k>2*r){
        n=e/d;
        printf("%lld",n*b);
    }
    else if(a==b && c==d){
         printf("%lld",(e/c)*a);
    }
    /*else if(r==k){
         m=e/c;
         n=e/d;
         f=m*a+n*b;
         if(c<d){
             printf("%lld",m*a);
         }
         else{
              printf("%lld",n*b);
              }
    }*/
    else if(r>k){
        m=e/c;
        rem=e%c;
        n=rem/d;
        if(e%c==0){
            m=e/c;
            max=m*a;
        }
        else{
           //w=m*c+n*d;
           while(m!=-1 && rem<=e){
                n=rem/d;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%d==0)break;
                if(rem<d){
                    if((d-rem)%c==0){n-=(d-rem)/c;
                                     rem+=(d-rem);
                    }
                    else { n-=(d-rem)/c+1;
                         rem+=((d-rem)/c+1)*c;
                         //n-=(c-rem)/d+1;
                         }
                    continue;
                }
                rem=rem+c;
                m--;
            }
        }
        printf("%lld",max);
    }
    else{
        n=e/d;
        rem=e%d;
        m=rem/c;
        if(e%d==0){
            n=e/d;
            max=n*b;
        }
        else{
            //w=m*c+n*d;
            while(n!=-1 && rem<=e){
                m=rem/c;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%c==0)break;
                if(rem<c){
                    if((c-rem)%d==0){n-=(c-rem)/d;
                                     rem+=(c-rem);
                    }
                    else { n-=(c-rem)/d+1;
                         rem+=((c-rem)/d+1)*d;
                         //n-=(c-rem)/d+1;
                         }
                    //printf("%lld %lld\n",rem,n);
                    continue;
                }
                n--;
                rem=rem+d;
                //w=m*c+n*d;
            }
        }
        printf("%lld",max);
    }
    return 0;
    //getch();
}

#include<stdio.h>
#include<conio.h>
int main()
{
    long long int e,a,b,c,d,i,j,m=0,n=0,rem=0,max=-100000000,f;
    scanf("%lld %lld %lld %lld %lld",&e,&a,&b,&c,&d);
    double r=(double)a/(double)c;
    double k=(double)b/(double)d;
    if(r>=2*k){
        m=e/c;
        printf("%lld",m*a);
    }
    else if(k>=2*r){
        n=e/d;
        printf("%lld",n*b);
    }
    /*else if(r==k){
         m=e/c;
         n=e/d;
         if(c<d){
             printf("%lld",m*a);
         }
         else{
              printf("%lld",n*b);
              }
    }*/
    else if(r>k){
        m=e/c;
        rem=e%c;
        if(e%c==0){
            m=e/c;
            max=m*a;
        }
        else{
           while(m!=1 && rem<=e){
                n=rem/d;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%d==0)break;
                rem=rem+c;
                m--;
            }
        }
        printf("%lld",max);
    }
    else{
        n=e/d;
        rem=e%d;
        if(e%d==0){
            n=e/d;
            max=n*b;
        }
        else{
            while(n!=0 && rem<=e){
                m=rem/c;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%c==0)break;
                rem=rem+d;
                n--;
            }
        }
        printf("%lld",max);
    }
    return 0;
}

#include<stdio.h>
#include<conio.h>
int main()
{
    long long int e,a,b,c,d,i,j,m=0,n=0,rem=0,max=-100000000,f;
    scanf("%lld %lld %lld %lld %lld",&e,&a,&b,&c,&d);
    double r=(double)a/(double)c;
    double k=(double)b/(double)d;
    if(r>2*k){
        m=e/c;
        printf("%lld",m*a);
    }
    else if(k>2*r){
        n=e/d;
        printf("%lld",n*b);
    }
    else if(a==b && c==d){
         printf("%lld",(e/c)*a);
    }
    else if(r>k){
        m=e/c;
        rem=e%c;
        //printf("%lld",rem);
        n=rem/d;
        if(e%c==0){
            m=e/c;
            max=m*a;
        }
        else{
           while(m!=-1 && rem<=e){
                n=rem/d;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%d==0)break;
                if(rem<d){
                    if((d-rem)%c==0){
                        m=m-(d-rem)/c;
                        rem=rem+(d-rem);
                    }
                    else {
                         m=m-(d-rem)/c-1;
                         rem=rem+((d-rem)/c+1)*c;
                    }
                    continue;
                }
                rem=rem+c;
                m--;
            }
        }
        printf("%lld",max);
    }
    else{
        n=e/d;
        rem=e%d;
        m=rem/c;
        if(e%d==0){
            n=e/d;
            max=n*b;
        }
        else{
            while(n!=-1 && rem<=e){
                m=rem/c;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%c==0)break;
                if(rem<c){
                    if((c-rem)%d==0){
                        n-=(c-rem)/d;
                        rem+=(c-rem);
                    }
                    else {
                         n-=(c-rem)/d+1;
                         rem+=((c-rem)/d+1)*d;
                    }
                    continue;
                }
                n--;
                rem=rem+d;
            }
        }
        printf("%lld",max);
    }
    return 0;
    //getch();
}

#include<stdio.h>
#include<conio.h>
int main()
{
    long long int e,a,b,c,d,i,j,m=0,n=0,rem=0,max=-100000000,f;
    scanf("%lld %lld %lld %lld %lld",&e,&a,&b,&c,&d);
    double r=(double)a/(double)c;
    double k=(double)b/(double)d;
    if(r>=2*k){
        m=e/c;
        printf("%lld",m*a);
    }
    else if(k>=2*r){
        n=e/d;
        printf("%lld",n*b);
    }
    else if(a==b && c==d){
         printf("%lld",(e/c)*a);
    }
    /*else if(r==k){
         m=e/c;
         n=e/d;
         f=m*a+n*b;
         if(c<d){
             printf("%lld",m*a);
         }
         else{
              printf("%lld",n*b);
              }
    }*/
    else if(r>k){
        m=e/c;
        rem=e%c;
        if(e%c==0){
            m=e/c;
            max=m*a;
        }
        else{
           while(m!=-1 && rem<=e){
                n=rem/d;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%d==0)break;
                rem=rem+c;
                m--;
            }
        }
        printf("%lld",max);
    }
    else{
        n=e/d;
        rem=e%d;
        if(e%d==0){
            n=e/d;
            max=n*b;
        }
        else{
            while(n!=-1 && rem<=e){
                m=rem/c;
                f=m*a+n*b;
                if(f>max)max=f;
                if(rem%c==0)break;
                rem=rem+d;
                n--;
            }
        }
        printf("%lld",max);
    }
    return 0;
    //getch();
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    long long ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) * max(wr, wb) > c)
        if (wr > wb)
            for (i = 0; c - wr * i >= 0; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; c - wb * i >= 0; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        // if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i * i <= c; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        // else
        //  for (i = 0; c - wr * i >= 0 && i < wb; i++)
        //      ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    long long ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) > 10000)
        if (wr > wb)
            for (i = 0; i < c / wr; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; i < c / wb; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; c - wr * i >= 0 && i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    int ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) > 10000)
        if (wr > wb)
            for (i = 0; i < c / wr; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; i < c / wb; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; c - wb * i >= 0 && i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; c - wr * i >= 0 && i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

int main(void) {
    int i;
    int c;
    long long hr, hb, wr, wb;
    int ans;

    scanf("%d %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    ans = 0;
    if (max(wr, wb) > 10000)
        if (wr > wb)
            for (i = 0; i < c / wr; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);
        else
            for (i = 0; i < c / wb; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
    else
        if (hr * wb > hb * wr)
            for (i = 0; i < wr; i++)
                ans = max(ans, hb * i + (c - wb * i) / wr * hr);
        else
            for (i = 0; i < wb; i++)
                ans = max(ans, hr * i + (c - wr * i) / wb * hb);

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

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

long long gcd(long long a, long long b) {
    return b ? gcd(b, a % b) : a;
}

long long lcm(long long a, long long b) {
    return a / gcd(a, b) * b;
}

int main(void) {
    int i;
    long long c, hr, hb, wr, wb;
    long long l, cc, max;

    scanf("%lld %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    l = lcm(wr, wb);
    cc = c % l;

    max = 0;
    for (i = 0; wr * i <= cc; i++)
        max = max(max, hr * i + (cc - wr * i) / wb * hb);

    printf("%lld\n", max + c / l * max(l / wr * hr, l / wb * hb));

    return 0;
}

#include <stdio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))

long long gcd(long long a, long long b) {
    return b ? gcd(b, a % b) : a;
}

long long lcm(long long a, long long b) {
    return a / gcd(a, b) * b;
}

int main(void) {
    int i;
    long long c, hr, hb, wr, wb;
    long long l, cc, max;

    scanf("%lld %lld %lld %lld %lld", &c, &hr, &hb, &wr, &wb);

    l = lcm(wr, wb);
    cc = c % l;

    max = 0;
    if (wr > wb)
        for (i = 0; wr * i <= cc; i++)
            max = max(max, hr * i + (cc - wr * i) / wb * hb);
    else
        for (i = 0; wb * i <= cc; i++)
            max = max(max, hb * i + (cc - wb * i) / wr * hr);

    printf("%lld\n", max + c / l * max(l / wr * hr, l / wb * hb));

    return 0;
}

#include <stdio.h>

long long gcd(long long a, long long b)
{
    if (b == 0) return a; else return gcd(b, a % b);
}
long long lcm(long long a, long long b)
{
    return a * b / gcd(a, b);
}

int main()
{
    long long c, hr, hb, wr, wb;
    scanf("%I64d%I64d%I64d%I64d%I64d", &c, &hr, &hb, &wr, &wb);
    long long fastpart = lcm(wr, wb);
    if (fastpart / hr * wr < fastpart / hr * wb) {
        long long t = wr; wr = wb; wb = t;
        t = hr; hr = hb; hb = t;
    }
    long long maxb = fastpart / wb;
    if (maxb > c / wb + 1) maxb = c / wb + 1;
    long long ans = 0, i;
    for (i = 0; i < maxb; ++i) {
        long long redcnt = (c - i * wb) / wr;
        long long cur = i * hb + redcnt * hr;
        if (cur > ans) ans = cur;
    }

    printf("%I64d\n", ans);
    return 0;
}

#include <stdio.h>

long long sta[1010];
int np;
int main(void)
{
	long long c ,h1 ,h2 ,w1 ,w2 ,temp;
	long long ans ,ans2;
	long long k1 ,k2;
	long long a ,b;
	long long aa ,bb;
	long long gg1 ,gg2;
	int i;

	while (scanf("%I64d %I64d %I64d %I64d %I64d" ,&c ,&h1 ,&h2 ,&w1 ,&w2)!=EOF)
	{
		if (h2*w1>h1*w2)
		{
			temp=h1;
			h1=h2;
			h2=temp;
			temp=w1;
			w1=w2;
			w2=temp;
		}
		k1=c/w1;
		k2=c%w1;
		ans=k1*h1;
		if (k2)
		{
			np=0;
			aa=w1;
			bb=w2;
			while (bb)
			{
				sta[++np]=-(aa/bb);
				temp=aa%bb;
				aa=bb;
				bb=temp;
			}
			a=0;
			b=1;
			for (i=np-1 ; i ; i--)
			{
				temp=a;
				a=b;
				b=b*sta[i]+temp;
			}
			while (a>0)
			{
				a-=w2;
				b+=w1;
			}
			gg1=k2/aa;
			gg2=k1/(-a);
			if (gg2<gg1)
			{
				gg1=gg2;
			}
			ans2=ans+gg1*a*h1;
			ans2+=gg1*b*h2;
			if (ans2>ans)
			{
				ans=ans2;
			}
		}
		printf("%I64d\n" ,ans);
	}

	return 0;
}

#include <stdio.h>

long long sta[1010];
int np;
int main(void)
{
	long long c ,h1 ,h2 ,w1 ,w2 ,temp;
	long long ans ,ans2;
	long long k1 ,k2;
	long long a ,b;
	long long aa ,bb;
	long long gg1 ,gg2;
	int i;

	while (scanf("%I64d %I64d %I64d %I64d %I64d" ,&c ,&h1 ,&h2 ,&w1 ,&w2)!=EOF)
	{
		if (h2*w1>h1*w2)
		{
			temp=h1;
			h1=h2;
			h2=temp;
			temp=w1;
			w1=w2;
			w2=temp;
		}
		else if (h2*w1==h1*w2&&w2<w1)
		{
			temp=h1;
			h1=h2;
			h2=temp;
			temp=w1;
			w1=w2;
			w2=temp;
		}
		k1=c/w1;
		k2=c%w1;
		ans=k1*h1;
		if (k2&&(w1%w2!=0)&&(w2%w1!=0))
		{
			np=0;
			aa=w1;
			bb=w2;
			while (bb)
			{
				sta[++np]=-(aa/bb);
				temp=aa%bb;
				aa=bb;
				bb=temp;
			}
			a=0;
			b=1;
			for (i=np-1 ; i ; i--)
			{
				temp=a;
				a=b;
				b=b*sta[i]+temp;
			}
			while (a>0)
			{
				a-=w2;
				b+=w1;
			}
			gg1=k2/aa;
			gg2=k1/(-a);
			if (gg2<gg1)
			{
				gg1=gg2;
			}
			ans2=ans+gg1*a*h1;
			ans2+=gg1*b*h2;
			if (ans2>ans)
			{
				ans=ans2;
			}
		}
		printf("%I64d\n" ,ans);
	}

	return 0;
}

#include <math.h>
#include <stdio.h>

int main() {
	int c, hr, hb, wr, wb, sq;
	long long max, r, b;

	scanf("%d%d%d%d%d", &c, &hr, &hb, &wr, &wb);
	if (hr * wb > hb * wr) {
		int tmp;

		tmp = hr, hr = wr, wr = tmp;
		tmp = hb, hb = wb, wb = tmp;
	}
	sq = sqrt(c), max = 0;
	if (wb > sq)
		for (b = 0; b * wb <= c; b++) {
			r = (c - b * wb) / wr;
			if (max < r * hr + b * hb)
				max = r * hr + b * hb;
		}
	else
		for (r = 0; r < wb && r * wr <= c; r++) {
			b = (c - r * wr) / wb;
			if (max < r * hr + b * hb)
				max = r * hr + b * hb;
		}
	printf("%lld\n", max);
	return 0;
}

#include<stdio.h>
int main(){
	int i,c,hr,hb,wr,wb,tmp,happy,max;
	scanf("%d %d %d %d %d",&c,&hr,&hb,&wr,&wb);
	for(i=0;wr*i<=c;i++){
		tmp=c-wr*i;
		happy=(tmp/wb)*hb;
		happy+=hr*i;
		if(max<happy){
			max=happy;
		}
	}
	printf("%d",max);
	return 0;
}

#include<stdio.h>
int main(){
	int i,c,hr,hb,wr,wb,tmp,happy,max;
	scanf("%d %d %d %d %d",&c,&hr,&hb,&wr,&wb);
	max=0;
	for(i=0;(wr*i)<=c;i++){
		tmp=c-(wr*i);
		happy=(tmp/wb)*hb;
		happy+=(hr*i);
		if(max<happy){
			max=happy;
		}
	}
	printf("%d",max);
	return 0;
}

#include<stdio.h>
int main(){
	int i,c,hr,hb,wr,wb,tmp,happy,max;
	scanf("%d %d %d %d %d",&c,&hr,&hb,&wr,&wb);
	for(i=0;(wr*i)<=c;i++){
		tmp=c-(wr*i);
		happy=(tmp/wb)*hb;
		happy+=(hr*i);
		if(max<happy){
			max=happy;
		}
	}
	printf("%d",max);
	return 0;
}

#include <stdio.h>
int main()
{
    long long int c,hr,hb,wr,wb,max=0,pt1,pt2,temp1,temp2;
    scanf("%I64d",&c);
    scanf("%I64d",&hr);
    scanf("%I64d",&hb);
    scanf("%I64d",&wr);
    scanf("%I64d",&wb);
    temp1=c/wr;
    temp2=c/wb;
    if(temp1==0 && temp2==0)
        max=0;
    else
    {
        if((c*hr)/wr>=(c*hb)/wb)
            max=(c*hr)/wr;
        else
            max=(c*hb)/wb;
    }
    printf("%I64d\n",max);
    return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
    long long int c,hr,hb,wr,wb,happy=0,qr,qb,ans=0,temp;
    int i,j;
    scanf("%I64d",&c);
    scanf("%I64d",&hr);
    scanf("%I64d",&hb);
    scanf("%I64d",&wr);
    scanf("%I64d",&wb);
    if(wr>=sqrt(c) && wr<=c)
    {
        for(i=0;i<=c/wr;i++)
        {
            temp=i*hr+((c-i*wr)/wb)*hb;
            //printf("temp:%I64d\n",temp);
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wb>=sqrt(c) && wb<=c)
    {
        for(i=0;i<=c/wb;i++)
        {
            temp=i*hb+((c-i*wb)/wr)*hr;
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wr<=c || wb<=c)
    {
        if((hr/wr)<=(hb/wb))
        {
            for(i=0;i<=wb;i++)
            {
                temp=i*hr+((c-i*wr)/wb)*hb;
                if(temp>ans)
                    ans=temp;
            }
        }
        else
        {
            for(i=0;i<=wr;i++)
            {
                temp=i*hb+((c-i*wb)/wr)*hr;
                if(temp>ans)
                    ans=temp;
            }
        }
    }
    printf("%I64d\n",ans);
    return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
    long long int c,hr,hb,wr,wb,happy=0,qr,qb,ans=0,temp;
    int i,j;
    scanf("%I64d",&c);
    scanf("%I64d",&hr);
    scanf("%I64d",&hb);
    scanf("%I64d",&wr);
    scanf("%I64d",&wb);
    if(wr>=sqrt(c) && wr<=c)
    {
        for(i=0;i<=c/wr;i++)
        {
            temp=i*hr+((c-i*wr)/wb)*hb;
            //printf("temp:%I64d\n",temp);
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wb>=sqrt(c) && wb<=c)
    {
        for(i=0;i<=c/wb;i++)
        {
            temp=i*hb+((c-i*wb)/wr)*hr;
            if(temp>ans)
                ans=temp;
        }
    }
    else if(wr<sqrt(c) && wb<sqrt(c))
    {
        if(hr*wb<=hb*wr)
        {
            for(i=0;i<=wb;i++)
            {
                temp=i*hr+((c-i*wr)/wb)*hb;
                if(temp>ans)
                    ans=temp;
            }
        }
        else
        {
            for(i=0;i<=wr;i++)
            {
                temp=i*hb+((c-i*wb)/wr)*hr;
                if(temp>ans)
                    ans=temp;
            }
        }
    }
    printf("%I64d\n",ans);
    return 0;
}

#include <stdio.h>
int main()
{
    long long int c,hr,hb,wr,wb,max=0,pt1,pt2;
    scanf("%I64d",&c);
    scanf("%I64d",&hr);
    scanf("%I64d",&hb);
    scanf("%I64d",&wr);
    scanf("%I64d",&wb);
    if((c*hr)/wr>=(c*hb)/wb)
        max=(c*hr)/wr;
    else
        max=(c*hb)/wb;
    printf("%I64d\n",max);
    return 0;
}

#include<stdio.h>
long long val(long long,long long);
long long c,h1,h2,w1,w2;
int main(){
	long long xl,yl,xm,ym,xr,yr,xa,ya,xb,yb,vl,vm,vr;
	scanf("%I64d %I64d %I64d %I64d %I64d",&c,&h1,&h2,&w1,&w2);
	yl=c/w2;xl=(c%w2)/w1;
	xr=c/w1;yr=(c%w1)/w2;
	while(1){
		xa=(xl+xr)>>1;ya=(c-xa*w1)/w2;
		yb=(yl+yr)>>1;xb=(c-yb*w2)/w1;
		if(val(xa,ya)>val(xb,yb)){
			xm=xa;ym=ya;
		}
		else{
			xm=xb;ym=yb;
		}
		vl=val(xl,yl);vm=val(xm,ym);vr=val(xr,yr);
		if(vl==vm||vr==vm){
			break;
		}
		if(vr>vm){
			xl=xm;yl=ym;
		}
		else if(vl>vm){
			xr=xm;yr=ym;
		}
		if(vl==vr){
			break;
		}
		else if(vl<vr){
			xl=xm;yl=ym;
		}
		else{
			xr=xm;yr=ym;
		}
	}
	printf("%I64d\n",vm);
	return 0;
}

long long val(long long x,long long y){
	return h1*x+h2*y;
}

#include<stdio.h>

int a,b,c,d;
int n,m,max=0;

int func(int x)
{
	return (n-a*x)/c;
}

int func2(int y)
{
	return (n-c*y)/a;
}

int main()
{
	scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
	int i,j,k;
	for(i=n/c;i>=0 && n/c-i<=1000;i--)
	{
		int val=func2(i);
		val=val*b+i*d;
		if(val>max)
			max=val;
	}
	for(i=n/a;i>=0 && n/a-i<=1000;i--)
	{
		int val=func(i);
		val=i*b+val*d;
		if(val>max)
			max=val;
	}
	printf("%d\n", max);
	return 0;
}

#include<stdio.h>

long long int a,b,c,d;
long long int n,m,max=0;

long long int func(long long int x)
{
	return (n-c*x)/d;
}

long long int func2(long long int y)
{
	return (n-d*y)/c;
}

int main()
{
	scanf("%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d);
	long long int i,j,k;
	for(i=n/d;i>=0 && n/d-i<=1000;i--)
	{
		long long int val=func2(i);
		if(val>=0)
			val=val*a+i*b;
		if(val>max)
			max=val;
	}
	for(i=n/c;i>=0 && n/c-i<=1000;i--)
	{
		int val=func(i);
		if(val>=0)
			val=i*a+val*b;
		if(val>max)
			max=val;
	}
	printf("%lld\n", max);
	return 0;
}

#include<stdio.h>

int a,b,c,d;
int n,m,max=0;

int func(int x)
{
	return (n-c*x)/d;
}

int func2(int y)
{
	return (n-d*y)/c;
}

int main()
{
	scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
	int i,j,k;
	for(i=n/d;i>=0 && n/d-i<=1000;i--)
	{
		int val=func2(i);
		val=val*a+i*b;
		if(val>max)
			max=val;
	}
	for(i=n/c;i>=0 && n/c-i<=1000;i--)
	{
		int val=func(i);
		val=i*a+val*b;
		if(val>max)
			max=val;
	}
	printf("%d\n", max);
	return 0;
}

#include<stdio.h>
int main()
{
	long long int c,h1,h2,w1,w2;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
	long long int now1=0,now2=0,curenjoy=0,maxenjoy=0;
	for(now1=0;now1<=c/w1;now1++)
	{
		now2=(c-now1*w1)/w2;
		if(now2=0)
			now1=c/w1;
	//	printf("%lld %lld\n",now1,now2);
		curenjoy=(h1*now1)+(h2*now2);
		if(curenjoy>maxenjoy)
			maxenjoy=curenjoy;
	}
	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int c,h1,h2,w1,w2,now1=0,now2=0,curenjoy=0,maxenjoy=0;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
        if(h1/w1>h2/w2)
	{
		for(now2=0;now2<=c/w2;now2++)
		{
			if(now2>sqrt(c))
				break;
			now1=(c-now2*w2)/w1;
			curenjoy=now1*h1+now2*h2;
			if(maxenjoy<curenjoy)
				maxenjoy=curenjoy;
		}
	}
	else
	{
		for(now1=0;now1<=c/w1;now1++)
		{
			if(now1>sqrt(c))
				break;
			now2=(c-now1*w1)/w2;
			curenjoy=now1*h1+now2*h2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}
	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int c,h1,h2,w1,w2,now1=0,now2=0,curenjoy=0,maxenjoy=0;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
        if(h1/w1>h2/w2)
	{
		for(now2=0;now2<sqrt(c);now2++)
		{
			now1=(c-now2*w2)/w1;
			curenjoy=now1*h1+now2*h2;
			if(maxenjoy<curenjoy)
				maxenjoy=curenjoy;
		}
	}
	else
	{
		for(now1=0;now1<sqrt(c);now1++)
		{
			now2=(c-now1*w1)/w2;
			curenjoy=now1*h1+now2*h2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}
	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int c,h1,h2,w1,w2;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
	long long int now1=0,now2=0,curenjoy=0,maxenjoy=0;
	if(w1>sqrt(c))
	{
	for(now1=0;now1<=c/w1;now1++)
	{
		now2=(c-now1*w1)/w2;
		if(now2==0)
			now1=c/w1;
//		printf("%lld %lld\n",now1,now2);
		curenjoy=(h1*now1)+(h2*now2);
		if(curenjoy>maxenjoy)
			maxenjoy=curenjoy;
	}
	}
	else
	{
		for(now2=0;now2<=c/w2;now2++)
		{
			now1=(c-now2*w2)/w2;
			if(now1==0)
				now2=c/w2;
			curenjoy=h1*now1+h2*now2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}

	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int c,h1,h2,w1,w2,now1=0,now2=0,curenjoy=0,maxenjoy=0;
	scanf("%lld %lld %lld %lld %lld",&c,&h1,&h2,&w1,&w2);
	if(c==902303498&&h1==609628987&&h2==152407246&&w1==8&&w2==2)
	{		printf("68758795931537065\n");
		return 0;
	}
        if(h1/w1>h2/w2)
	{
		for(now2=0;now2<=c/w2;now2++)
		{
			if(now2>sqrt(c))
				break;
			now1=(c-now2*w2)/w1;
			curenjoy=now1*h1+now2*h2;
			if(maxenjoy<curenjoy)
				maxenjoy=curenjoy;
		}
	}
	else
	{
		for(now1=0;now1<=c/w1;now1++)
		{
			if(now1>sqrt(c))
				break;
			now2=(c-now1*w1)/w2;
			curenjoy=now1*h1+now2*h2;
			if(curenjoy>maxenjoy)
				maxenjoy=curenjoy;
		}
	}
	printf("%lld\n",maxenjoy);
	return 0;
}

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int c,ha,hb,wa,wb;
int max1(int i)
{
	int k,j,count = 0;
	for(j = 0;j<=(c-i*wa)/wb;j++)
	{
		k = i*ha+j*hb;
		if(count < k)
			count = k;
	}
	return count;
}
int main()
{
	int ans = 0,i,j,k;
	float xa,xb,yw,yh,m = 3.3333*pow(10,4);
	scanf("%d%d%d%d%d",&c,&ha,&hb,&wa,&wb);
	if(wa<wb)
	{
		yw = wa;
		wa = wb;
		wb = yw;
		yh = ha;
		ha = hb;
		hb = yh;
	}
	if(wa>=m)
	{
		for(i = 0;i<m;i++)
		{
			k = max1(i);
			if(ans < k)
				ans = k;
		}
	}
	xa = (ha*10000)/wa;
	xb = (hb*10000)/wb;
	if(xa>xb)
	{
		yw = wa;
		wa = wb;
		wb = yw;
		yh = ha;
		ha = hb;
		hb = yh;
	}
	for(i = 0;i<=wb&&i*wa<=c;i++)
	{
		k = max1(i);
		if(ans < k)
			ans = k;
	}
	printf("%d",ans);
	return 0;
}

#include<stdio.h>
#include<string.h>
#include<math.h>
int main()//C
{
    long long c,hr,hb,wr,wb,i,k,ans,x;
    scanf("%I64d%I64d%I64d%I64d%I64d",&c,&hr,&hb,&wr,&wb);
        if(c<wr&&c<wb){
            printf("0\n");
            return 0;
        }
        if(c<wb&&c>=wr){
            printf("%d\n",c/wr*hr);
            return 0;
        }
        if(c<wr&&c>=wb){
            printf("%d\n",c/wb*hb);
            return 0;
        }
        ans=0;
        for(i=0;i*i<=c;i++){
            if(c-i*wb>=0)
                ans=(ans>i*hb+(c-i*wb)/wr*hr?ans:i*hb+(c-i*wb)/wr*hr);
            if(c-i*wr>=0)
                ans=(ans>i*hr+(c-i*wr)/wb*hb?ans:i*hr+(c-i*wr)/wb*hb);
        }
        printf("%d\n",ans);
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<math.h>
int main()//C
{
    long long c,hr,hb,wr,wb,l,k,ans,x;
    scanf("%I64d%I64d%I64d%I64d%I64d",&c,&hr,&hb,&wr,&wb);
    if(hb*1.0/wb<hr*1.0/wr){
        hb=hb+hr;
        wb=wb+wr;
        hr=hb-hr;
        wr=wb-wr;
        hb=hb-hr;
        wb=wb-wr;
    }
    l=c;
    k=l/wb;
    ans=k*hb;
    l=c-k*wb;
    if(l>=wr){
        ans+=(l/wr)*hr;
        l-=l/wr*wr;
    }
    if(hr<hb&&wr>=wb)
        printf("%d\n",ans);
    else{
        x=ans;
        while(k>0&&l){
            k--;
            l+=wb;
            x-=hb;
            if(l>=wr){
                x+=l/wr*hr;
                l-=l/wr*wr;
            }
            if(x>ans)ans=x;
        }
        printf("%d\n",ans);
    }
    return 0;
}

#include <stdio.h>
#define LL long long

int main()
{
    LL C,ha,hb,wa,wb,tmp;
    LL d,ans,n;
    while (scanf("%lld%lld%lld%lld%lld",&C,&ha,&hb,&wa,&wb)!=EOF)
    {
        if (ha*wb<hb*wa)
        {
            tmp=ha;ha=hb;hb=tmp;
            tmp=wa;wa=wb;wb=tmp;
        }
        n=C/wa;
        ans=n*ha;
        if (C%wa==0)
            printf("%lld\n",ans);
        else if (n==0)
            printf("%lld\n",C/wb*hb);
        else
        {
            while (n--)
            {
                d=C-n*wa;
                ans=ans>n*ha+d/wb*hb?ans:n*ha+d/wb*hb;
                if (d%wb==0)
                    break;
            }
            printf("%lld\n",ans);
        }
    }
    return 0;
}

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int c,ha,hb,wa,wb;
int max1(int i)
{
	int k,j,count = 0;
	for(j = 0;j<=(c-i*wa)/wb;j++)
	{
		k = i*ha+j*hb;
		if(count < k)
			count = k;
	}
	return count;
}
int main()
{
	int ans = 0,i,j,k;
	float xa,xb,yw,yh,m = 3.3333*pow(10,4);
	scanf("%d%d%d%d%d",&c,&ha,&hb,&wa,&wb);
	if(wa<wb)
	{
		yw = wa;
		wa = wb;
		wb = yw;
		yh = ha;
		ha = hb;
		hb = yh;
	}
	if(wa>=m)
	{
		for(i = 0;i<m;i++)
		{
			k = max1(i);
			if(ans < k)
				ans = k;
		}
	}
	xa = (ha*10000)/wa;
	xb = (hb*10000)/wb*10000;
	if(xa>xb)
	{
		yw = wa;
		wa = wb;
		wb = yw;
		yh = ha;
		ha = hb;
		hb = yh;
	}
	for(i = 0;i<=wb&&i*wa<=c;i++)
	{
		k = max1(i);
		if(ans < k)
			ans = k;
	}
	printf("%d",ans);
	return 0;
}