#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

struct dd
{
	long long w,u;
};

long long n,a,b,c,d,e,f,g,h,m,i;
dd cow[1501];
long long ans;

int comp(const void *a,const void  *b)
{
	const dd *ca=(const dd*)a,*cb=(const dd*)b;
	if (ca->u!=cb->u)
		return cb->u - ca->u;
	else
		return ca->w - cb->w;
}

int main()
{
	freopen("farmoff.in","r",stdin);
	freopen("farmoff.out","w",stdout);
	cin>>n>>a>>b>>c>>d>>e>>f>>g>>h>>m;
	for (i=0;i<3*n;i++) 
	{
		cow[i].w=((((((a*i)%d*i)%d*i)%d*i)%d*i)%d)+(((b*i)%d*i)%d)+c%d;
		cow[i].u=((((((e*i)%h*i)%h*i)%h*i)%h*i)%h)+((((f*i)%h*i)%h*i)%h)+g%h;
	}
	qsort(cow,3*n,sizeof(dd),comp);
	for (i=0;i<n;i++) ans+=cow[i].w;
	cout<<ans<<endl;
	return 0;
}