#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long N;cin>>N;
	vector<pair<int,int> >A(3);
	for(int i=0;i<3;i++)cin>>A[i].first>>A[i].second;
	sort(A.begin(),A.end(),[](pair<int,int>l,pair<int,int>r)
	{
		return l.second*r.first>r.second*l.first;
	});
	long ans=0;
	for(int y=0;y<A[0].first;y++)for(int z=0;z<A[0].first;z++)
	{
		long u=(long)y*A[1].first+(long)z*A[2].first;
		if(u<=N)
		{
			long x=(N-u)/A[0].first;
			ans=max(ans,x*A[0].second+(long)y*A[1].second+(long)z*A[2].second);
		}
	}
	cout<<ans<<endl;
}