#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 <map>
#include <numeric>
#include <queue>
#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; }

////////////////////////////////////////////////////////////////////////////////
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>;


int main() {
  Int N;
  Mint A, B[2];
  
  for (; ~scanf("%lld%u%u%u", &N, &A.x, &B[0].x, &B[1].x); ) {
    const Int sqrtN = sqrt((long double)N);
    
    Int m[2] = {1, 1};
    m[0] = m[1] = 1;
    // [0][0], [1][1]: offset of the other
    // [0][1], [1][0]: length
    vector<Mint> f[2][2];
    f[0][0] = f[1][1] = {1};
    f[0][1] = f[1][0] = {0, 1};
    
    for (; ; ) {
cerr<<"m = ";pv(m,m+2);
#ifdef LOCAL_
for(int s=0;s<2;++s)for(int t=0;t<2;++t)cerr<<"f["<<s<<"]["<<t<<"] = "<<f[s][t]<<endl;
auto brute=[&](Int r0,Int r1,Int len)->Mint{
 Mint ret=0;
 Mint a=1;
 for(Int i=0;i<len;++i){
  Mint prod=a;
  for(Int x=(r0+i)%m[0];x;x/=2){if(x%2>=1)prod*=B[0];}
  for(Int x=(r1+i)%m[1];x;x/=3){if(x%3>=1)prod*=B[1];if(x%3>=2)prod*=B[1];}
  ret+=prod;
  a*=A;
 }
// cerr<<"  brute "<<r0<<" "<<r1<<" "<<len<<" = "<<ret<<endl;
 return ret;
};
for(int i=0;i<m[1];++i)assert(brute(0,i,m[0])==f[0][0][i]);
for(int i=0;i<m[0];++i)assert(brute(i,0,m[1])==f[1][1][i]);
for(int i=0;i<=min(m[0],m[1]);++i)assert(brute(0,m[1]-i,i)==f[0][1][i]);
for(int i=0;i<=min(m[0],m[1]);++i)assert(brute(m[0]-i,0,i)==f[1][0][i]);
#endif
      
      int s, t;
      Int mm;
      if (m[0] <= m[1]) {
        s = 0;
        t = 1;
        mm = 2 * m[0];
      } else {
        s = 1;
        t = 0;
        mm = 3 * m[1];
      }
      if (mm > sqrtN) {
        break;
      }
      
      vector<Mint> as(min(mm, m[t]) + 1);
      as[0] = 1;
      for (int i = 0; i < min(mm, m[t]); ++i) as[i + 1] = as[i] * A;
      const Mint bs[3] = {1, B[s], B[s] * B[s]};
      
      auto calc = [&](Int Rs, Int rt, Int len) -> Mint {
        Mint ret = 0;
        Mint a = 1;
        Int rs = Rs % m[s];
        for (; len > 0; ) {
          const Int d = min(m[s] - rs, m[t] - rt);
          const Int rrs = ((rs + d == m[s]) ? 0 : (rs + d)); 
          const Int rrt = ((rt + d == m[t]) ? 0 : (rt + d)); 
          assert(rs == 0 || rt == 0);
          assert(rrs == 0 || rrt == 0);
          ret += a * bs[Rs / m[s]] * (
            (rs == 0)
                ? ((rrs == 0) ? f[s][s][rt] : f[s][t][d])
                : ((rrs == 0) ? f[t][s][d] : f[t][t][rs])
          );
          Rs = ((Rs + d) == mm) ? 0 : (Rs + d);
          rs = rrs;
          rt = rrt;
          len -= d;
          a *= as[d];
        }
        return ret;
      };
      
      vector<Mint> g[2][2];
      g[s][s].assign(m[t], 0);
      g[t][t].assign(mm, 0);
      g[s][t].assign(min(mm, m[t]) + 1, 0);
      g[t][s].assign(min(mm, m[t]) + 1, 0);
      for (int i = 0; i < m[t]; ++i) g[s][s][i] = calc(0, i, mm);
      for (int i = 0; i < mm; ++i) g[t][t][i] = calc(i, 0, m[t]);
      for (int i = 0; i <= min(mm, m[t]); ++i) g[s][t][i] = calc(0, m[t] - i, i);
      for (int i = 0; i <= min(mm, m[t]); ++i) g[t][s][i] = calc(mm - i, 0, i);
      
      m[s] = mm;
      for (int ss = 0; ss < 2; ++ss) for (int tt = 0; tt < 2; ++tt) {
        f[ss][tt] = g[ss][tt];
      }
    }
    
    vector<Mint> as(min(m[0], m[1]) + 1);
    as[0] = 1;
    for (int i = 0; i < min(m[0], m[1]); ++i) as[i + 1] = as[i] * A;
    Int lim[2];
    vector<Mint> bs[2];
    for (int s = 0; s < 2; ++s) {
      lim[s] = max(m[s], N / m[s] + 1);
      bs[s].resize(lim[s]);
      bs[s][0] = 1;
      for (int i = 1; i < lim[s]; ++i) {
        bs[s][i] = bs[s][i / ((s == 0) ? 2 : 3)];
        if (s == 0 && i % 2 >= 1) bs[s][i] *= B[s];
        if (s == 1 && i % 3 >= 1) bs[s][i] *= B[s];
        if (s == 1 && i % 3 >= 2) bs[s][i] *= B[s];
      }
    }
    
    Mint ans = 0;
    Mint a = 1;
    for (Int n = 0; n < N + 1; ) {
      const Int d = min(m[0] - n % m[0], m[1] - n % m[1]);
      if (n + d <= N + 1) {
        Mint low;
        if (n % m[0] == 0) {
          if ((n + d) % m[0] == 0) {
            low = f[0][0][n % m[1]];
          } else {
            low = f[0][1][d];
          }
        } else {
          if ((n + d) % m[0] == 0) {
            low = f[1][0][d];
          } else {
            low = f[1][1][n % m[0]];
          }
        }
        ans += a * bs[0][n / m[0]] * bs[1][n / m[1]] * low;
        n += d;
        a *= as[d];
      } else {
        for (; n < N + 1; ++n) {
          ans += a * bs[0][n / m[0]] * bs[0][n % m[0]] * bs[1][n / m[1]] * bs[1][n % m[1]];
          a *= A;
        }
      }
    }
    // n = 0
    ans -= 1;
    printf("%u\n", ans.x);
  }
  return 0;
}