#include<iostream>
#include<cmath>
using namespace std;

int gs[3],jg[3];
int minf=100010;
int n,tmp,gg;

int main()
{
	cin>>n;
	int m=3;
     for(int i=0;i<m;i++)
	{
		cin>>gs[i]>>jg[i];
		 if(gs[i]==gs[i+1])
		 {
			 if(jg[i]>jg[i+1])
			     gg=jg[i+1];
			else
				gg=jg[i];
			 minf=gg*gs[i];
			 cout<<minf;
		 }
		if(n%gs[i]==0)
			tmp=ceil(n/gs[i]);
		else tmp=ceil(n/gs[i]+0.5);
		int sum=tmp*jg[i];
		if(sum<minf)
		{
			minf=sum;
		}
	}

	cout<<minf;
	
		
	
}