#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
typedef long long LL;
const LL mod=1000000007,m=5;
LL n,A0,AX,AY,B0,BX,BY;
struct Mat{
	LL v[m][m];
	Mat (){}
	Mat (LL x){
		(*this).set(x);
	}
	void set(LL x){
		memset(v,0,sizeof v);
		if (x==1)
			for (int i=0;i<m;i++)
				v[i][i]=1;
	}
	Mat operator * (Mat x){
		Mat ans(0);
		for (int i=0;i<m;i++)
			for (int j=0;j<m;j++)
				for (int k=0;k<m;k++)
					ans.v[i][j]=(ans.v[i][j]+v[i][k]*x.v[k][j])%mod;
		return ans;
	}
	void operator *= (Mat x){
		(*this)=(*this)*x;
	}
}M,Md;
Mat MatPow(Mat x,LL y){
	Mat ans(1),now=x;
	while (y){
		if (y&1LL)
			ans*=now;
		now*=now;
		y>>=1;
	}
	return ans;
}
int main(){
	while (~scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&A0,&AX,&AY,&B0,&BX,&BY)){
		if (!n){
			puts("0");
			continue;
		}
		A0%=mod,AX%=mod,AY%=mod,B0%=mod,BX%=mod,BY%=mod;
		LL NewArr[m][m]={{1         ,0         ,0  ,0  ,0},
						 {AX*BX%mod ,AX*BX%mod ,0  ,0  ,0},
						 {AX*BY%mod ,AX*BY%mod ,AX ,0  ,0},
						 {BX*AY%mod ,BX*AY%mod ,0  ,BX ,0},
						 {AY*BY%mod ,AY*BY%mod ,AY ,BY ,1}};
		LL NewArr2[m]=	 {A0*B0%mod ,A0*B0%mod ,A0 ,B0 ,1};
		memcpy(Md.v,NewArr,sizeof NewArr);
		memcpy(M.v[0],NewArr2,sizeof NewArr2);
		Md=MatPow(Md,n-1);
		M*=Md;
		printf("%lld\n",M.v[0][0]);
	}
	return 0;
}