// virtual after solving this as ucup, sorry (this code is written during virtual)

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


constexpr int E = 50;
constexpr int F = 30;
Int two[E + 1], thr[F + 1];

int calc2(Int n) {
  int ret = 0;
  for (; n; n >>= 1) ret += (n & 1);
  return ret;
}
int calc3(Int n) {
  int ret = 0;
  for (; n; n /= 3) ret += n % 3;
  return ret;
}

Int N;
Mint X, Y, Z;

int main() {
  two[0] = thr[0] = 1;
  for (int e = 1; e <= E; ++e) two[e] = two[e - 1] * 2;
  for (int f = 1; f <= F; ++f) thr[f] = thr[f - 1] * 3;
  
  for (; ~scanf("%lld%u%u%u", &N, &X.x, &Y.x, &Z.x); ) {
    ++N;
    
    vector<Mint> YY(E + 1), ZZ(2 * F + 1);
    YY[0] = ZZ[0] = 1;
    for (int e = 1; e <= E; ++e) YY[e] = YY[e - 1] * Y;
    for (int f = 1; f <= 2 * F; ++f) ZZ[f] = ZZ[f - 1] * Z;
    
    int e = 0, f = 0;
    vector<Int> ns{0, 1};
    vector<Mint> ws{1};
    for (; !(N < two[e] * thr[f]); ) {
      const int len = ws.size();
      vector<Int> nns{0};
      vector<Mint> wws;
      int ee = e, ff = f;
      auto add = [&](Int l, Int r, Mint w) -> void {
// cerr<<"  [add] "<<l<<" "<<r<<" "<<w<<endl;
        assert(nns.back() == l);
        if (l % two[ee] != 0 && l % thr[ff] != 0) {
          nns.back() = r;
          wws.back() += w;
        } else {
          nns.push_back(r);
          wws.push_back(w);
        }
      };
      if (two[e] <= thr[f]) {
        ++ee;
        for (int a = 0; a < 2; ++a) {
          const Int shift = two[e] * thr[f] * a;
          const Mint x = X.pow(shift);
          for (int i = 0; i < len; ++i) {
            add(shift + ns[i], shift + ns[i + 1], x * YY[(shift + ns[i]) / two[e] % 2] * ws[i]);
          }
        }
      } else {
        ++ff;
        for (int b = 0; b < 3; ++b) {
          const Int shift = two[e] * thr[f] * b;
          const Mint x = X.pow(shift);
          for (int i = 0; i < len; ++i) {
            add(shift + ns[i], shift + ns[i + 1], x * ZZ[(shift + ns[i]) / thr[f] % 3] * ws[i]);
          }
        }
      }
      e = ee;
      f = ff;
      ns.swap(nns);
      ws.swap(wws);
cerr<<"e="<<e<<" f="<<f<<" "<<two[e]<<" "<<thr[f]<<" "<<ws.size()<<endl;
// cerr<<ns<<endl<<ws<<endl;
    }
    
    const int len = ws.size();
    Mint ans = 0;
    for (int i = 0; i < len; ++i) {
      if (ns[i + 1] <= N) {
        ans += YY[calc2(ns[i] / two[e])] * ZZ[calc3(ns[i] / thr[f])] * ws[i];
      } else {
        Mint x = X.pow(ns[i]);
        for (Int n = ns[i]; n < N; ++n) {
          ans += x * YY[calc2(n)] * ZZ[calc3(n)];
          x *= X;
        }
        break;
      }
    }
    ans -= 1;
    printf("%u\n", ans.x);
#ifdef LOCAL
if(N<=1'000'000){
 Mint brt=0;
 for(Int n=1;n<N;++n)brt+=X.pow(n)*Y.pow(calc2(n))*Z.pow(calc3(n));
 if(brt!=ans){
  cerr<<"FAIL N="<<N<<" "<<X<<" "<<Y<<" "<<Z<<": "<<brt<<" "<<ans<<endl;
  if(N<=100)for(Int n=0;n<two[e]*thr[f];++n)cerr<<n<<": "<<X.pow(n)<<" "<<Y.pow(calc2(n))<<" "<<Z.pow(calc3(n))<<": "<<X.pow(n)*Y.pow(calc2(n))*Z.pow(calc3(n))<<endl;
 }
 assert(brt==ans);
}
#endif
  }
  return 0;
}