#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<cassert>
using namespace std;
using LL = long long;

const int mod = 998244353;

void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
}

int mul(int a, int b){
    return 1LL * a * b % mod;
}

const int N = 3162278;
struct FastPow{
    int pow1[N + 1], pow2[N + 1];

    void init(int x) {
        pow1[0] = pow2[0] = 1;
        for(int i = 1; i <= N; i++){
            pow1[i] = mul(pow1[i - 1], x);
        }
        for(int i = 1; i <= N; i++){
            pow2[i] = mul(pow2[i - 1], pow1[N]);
        }
    }

    int operator[](LL x){
        return mul(pow1[x % N], pow2[x / N]);
    }

}powx;

int powy[70], powz[70];
LL pow3[70];
int pc3[5000005];
int a[70], len;
vector<int> f[15][2];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    LL n; int x, y, z;
    cin >> n >> x >> y >> z;
    powx.init(x);
    powy[0] = powz[0] = 1;
    pow3[0] = 1;
    for(int i = 1; i <= 30; i++){
        pow3[i] = pow3[i - 1] * 3;
    }
    for(int i = 1; i <= 60; i++){
        powy[i] = mul(powy[i - 1], y);
        powz[i] = mul(powz[i - 1], z);
    }
    LL bk = n;
    while(n){
        a[++len] = n % 3;
        n /= 3;
    }

    auto dfs1 = [&](auto &&dfs1, int u, int val, int s) -> void {
        if (u == len / 2){
            pc3[val] = s;
            return;
        }
        for(int i = 0; i < 3; i++){
            dfs1(dfs1, u + 1, val * 3 + i, s + i);
        }
    };

    dfs1(dfs1, 0, 0, 0);

    for(int i = 0; i <= len / 2; i++){
        for(int j = 0; j < 2; j++){
            f[i][j].resize(1 << (i + 9));
        }
    }

    for(int val = 0; val < f[0][0].size(); val++){
        f[0][0][val] = powy[__builtin_popcount(val)];
    }
    for(int u = 1; u <= len / 2; u++){
        const int bit = u + 9;
        const int mask = (1 << (bit - 1)) - 1;
        for(int carry = 0; carry < 2; carry++){
            for(int val = 0; val < f[u][carry].size(); val++){
                int sum = 0;
                for(int i = 0; i < 3; i++){
                    int nval = val + i * pow3[u - 1];
                    if (nval >= (1 << bit)){
                        if (carry){
                            int cur_bit = (nval >> (bit - 1) & 1);
                            for(int j = 0; cur_bit + j < 2; j++){
                                add(sum, mul(mul(powy[cur_bit + j], powz[i]), mul(powx[i * pow3[u - 1]], f[u - 1][j][nval & mask])));
                            }
                        }
                    }
                    else{
                        int cur_bit = (nval >> (bit - 1) & 1);
                        for(int j = 0; j < 2; j++){
                            if ((j + cur_bit) / 2 == carry){
                                add(sum, mul(mul(powy[(cur_bit + j) % 2], powz[i]), mul(powx[i * pow3[u - 1]], f[u - 1][j][nval & mask])));
                            }
                        }
                    }
                }
                f[u][carry][val] = sum;
            }
        }
    }

    int ans = 0;

    auto dfs2 = [&](auto &&dfs2, int u, bool lim, int val, int s) -> void {
        if (u == len / 2){
            if (lim){
                int remain = bk - val * pow3[len / 2];
                for(int i = 0; i <= remain; i++){
                    LL cur = val * pow3[len / 2] + i;
                    add(ans, mul(mul(powx[cur], powz[s + pc3[i]]), powy[__builtin_popcountll(cur)]));
                }
                return;
            }
            const int mask = (1 << (u + 9)) - 1;
            for(int i = 0; i < 2; i++){
                LL nval = val * pow3[len / 2] + (i << (u + 9));
                int t = f[len / 2][i][nval & mask];
                add(ans, mul(mul(powx[val * pow3[len / 2]], powy[__builtin_popcountll(nval >> (u + 9))]), mul(powz[s], t)));
            }
            return;
        }
        int up = lim ? a[u] : 2;
        for(int i = 0; i <= up; i++){
            dfs2(dfs2, u - 1, lim and (i == up), val * 3 + i, s + i);
        }
    };

    dfs2(dfs2, len, true, 0, 0);
    cout << (ans - 1 + mod) % mod << '\n';

}