#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

constexpr int N = 1e7 + 10, MOD = 998244353;

int n;
ll x[N], y[24], z[30], p3[15], ans;

void dfs(int cur, int val, int s) {
    if (val > n) return;
    if (cur == 15) ans = (ans + x[val] * y[__builtin_popcount(val)] % MOD * z[s]) % MOD;
    else for (int i : {0, 1, 2}) dfs(cur + 1, val + i * p3[cur], s + i);
}

int main() {
    freopen("ex_conversion1.in", "r", stdin), freopen("conversion.out", "w", stdout);
    ios_base::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
    cin >> n >> x[1] >> y[1] >> z[1];
    x[0] = y[0] = z[0] = p3[0] = 1;
    for (int i = 2; i <= n; i++) x[i] = x[i - 1] * x[1] % MOD;
    for (int i = 2; i <= 23; i++) y[i] = y[i - 1] * y[1] % MOD;
    for (int i = 2; i <= 29; i++) z[i] = z[i - 1] * z[1] % MOD;
    for (int i = 1; i <= 14; i++) p3[i] = p3[i - 1] * 3;
    dfs(0, 0, 0);
    cout << (ans - 1 + MOD) % MOD << '\n';
    return 0;
}