#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int LG = 28;
constexpr int P = 998244353;
LL n;
int x, y, z;

IL constexpr int qpow (int b, int k = P - 2) {
  int r = 1;
  for (; k; k >>= 1, b = (LL)b * b % P) if (k & 1) r = (LL)r * b % P;
  return r;
}

LL p3[LG + 3], sum[LG / 2 + 3];
int l[LG + 3], bt[LG + 3], ppc[1 << 10], pwx[LG + 3][3], pwy[1 << 10], pwz[3];

void init () {
  p3[0] = 1;
  L (i, 1, LG) {
    p3[i] = p3[i - 1] * 3;
  }
  L (i, 0, LG) {
    while (p3[i] >> l[i]) {
      ++l[i];
    }
  }
  L (i, 1, LG / 2) {
    sum[i] = sum[i - 1] + (1 << l[i]);
  }
  pwy[0] = 1;
  L (i, 1, (1 << 10) - 1) {
    ppc[i] = ppc[i >> 1] + i % 2;
    pwy[i] = (LL)pwy[i - 1] * y % P;
  }
  pwz[0] = 1, pwz[1] = z, pwz[2] = (LL)z * z % P;
  L (i, 0, LG) {
    int X = qpow(x, p3[i] % (P - 1));
    pwx[i][0] = 1, pwx[i][1] = X, pwx[i][2] = (LL)X * X % P;
  }
  L (i, 0, LG) {
    bt[i] = n % 3;
    n /= 3;
  }
}

int f[1 << 24][2];

int dfs (int d, LL cur, bool c, bool lim) {
  if (d == -1) {
    return c ? 0 : pwy[ppc[cur]];
  }
  if (!lim && d < LG / 2 && ~f[cur + sum[d]][c]) {
    return f[cur + sum[d]][c];
  }
  int s = 0;
  L (i, 0, lim ? bt[d] : 2) {
    L (nc, 0, 1) {
      LL ncur = cur + ((LL)nc << l[d]) + p3[d] * i;
      if ((ncur >> l[d + 1]) != c) {
        continue;
      }
      ncur &= (1LL << l[d + 1]) - 1;
      int X = pwx[d][i], Y = pwy[ppc[ncur >> l[d]]], Z = pwz[i];
      s = (s + (LL)X * Y % P * Z % P * dfs(d - 1, ncur & ((1LL << l[d]) - 1), nc, lim & (i == bt[d]))) % P;
    }
  }
  if (!lim && d < LG / 2) {
    f[cur + sum[d]][c] = s;
  }
  return s;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> x >> y >> z;
  init();
  memset(f, -1, sizeof(f));
  cout << (P - 1 + dfs(LG - 1, 0, false, true)) % P << '\n';
}
// I love WHQ!