题目链接：https://ac.nowcoder.com/acm/contest/119232/F

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128=__int128;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using db = double;
using ldb = long double;
#define F first
#define S second
#define int ll
const int MOD=1e9+7;
ll ksm(ll a,ll x,ll mod=MOD){
    a%=mod;
    if(a==0) return 0;
    ll ans=1;
    while(x){
        if(x&1) ans=(ans*a)%mod;
        a=(a*a)%mod;
        x>>=1;
    }
    return ans;
}
struct matrix{
    vector<vector<ll>> a;
    int n;
    matrix(int x,bool _=false){
        n=x;
        a.assign(n+1,vector<ll>(n+1,0));
        if(_){
            for(int i=1;i<=n;i++) a[i][i]=1;
        }
    }
    matrix operator*(const matrix &b)const{
        matrix res(n);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                for(int k=1;k<=n;k++){
                    res.a[i][j]=(res.a[i][j]+a[i][k]*b.a[k][j]%(MOD-1))%(MOD-1);
                }
            }
        }
        return res;
    }
    static matrix ksm(matrix x,ll y){
        matrix res(x.n,true);
        while(y){
            if(y&1) res=res*x;
            x=x*x;
            y>>=1;
        }
        return res;
    }
};
void solve(){
    ll n,x,y,a,b;cin>>n>>x>>y>>a>>b;
    x%=MOD,y%=MOD,a%=MOD;
    if(n==1){
        cout<<x%MOD<<"\n";
        return;
    }
    if(n==2){
        cout<<y%MOD<<"\n";
        return;
    }
    if(x==0||y==0||a==0){
        cout<<"0\n";
        return;
    }
    matrix ansx(2),ansy(2),base1(2);
    ansx.a[1][1]=0,ansx.a[1][2]=1;
    ansy.a[1][1]=1,ansy.a[1][2]=0;
    base1.a[1][1]=base1.a[1][2]=base1.a[2][1]=1;
    ansx=ansx*matrix::ksm(base1,n-2);
    ansy=ansy*matrix::ksm(base1,n-2);
    ll cntx=ansx.a[1][1],cnty=ansy.a[1][1];
    matrix anst(3),base2(3);
    anst.a[1][3]=1;
    base2.a[1][1]=base2.a[1][2]=base2.a[2][1]=base2.a[3][1]=base2.a[3][3]=1;
    anst=anst*matrix::ksm(base2,n-2);
    ll cntt=anst.a[1][1];
    ll ans=ksm(x,cntx)*ksm(y,cnty)%MOD*ksm(ksm(a,b),cntt)%MOD;
    cout<<ans<<"\n";
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}