#include <bits/stdc++.h>
using namespace std;
const int P = 998244353;
inline void add(int &x, int y) {
	(x += y) >= P && (x -= P);
}
inline int Add(int x, int y) {
	return add(x, y), x;
}
inline void sub(int &x, int y) {
	(x -= y) < 0 && (x += P);
}
inline int Sub(int x, int y) {
	return sub(x, y), x;
}
inline void mul(int &x, int y) {
	x = 1ull * x * y % P;
}
inline int Mul(int x, int y) {
	return 1ull * x * y % P;
}
int power(int a, int b) {
	int res = 1;
	for (; b; b >>= 1) {
		if (b & 1) {
			mul(res, a);
		}
		mul(a, a);
	}
	return res;
}
using ull = unsigned long long;
using poly = vector<int>;
const int L = 1 << 21;
int Omgs[L], rev[L];
void set_up() {
	int Omg = power(3, (P - 1) / L); 
	Omgs[L >> 1] = 1;
	for (int i = (L >> 1) + 1; i < L; ++i) {
		Omgs[i] = Mul(Omgs[i - 1], Omg);
	}
	for (int i = (L >> 1) - 1; i; --i) {
		Omgs[i] = Omgs[i << 1];
	}
}
int extend(int len) {
	int n =	1;
	while (n < len) {
		n <<= 1;
	}
	for (int i = 0; i < n; ++i) {
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) ? (n >> 1) : 0);
	}
	return n;
}
void dft(ull *a, int n) {
	for (int i = 0; i < n; ++i) {
		if (i < rev[i]) {
			swap(a[i], a[rev[i]]);
		}
	}
	for (int k = 1; k < n; k <<= 1) {
		if (k == 1 << 18) {
			for (int i = 0; i < n; ++i) {
				a[i] %= P;
			}
		}
		for (int i = 0; i < n; i += k << 1) {
			ull *p = a + i, *q = a + i + k;
			int *w = Omgs + k;
			for (int j = 0; j < k; ++j, ++p, ++q, ++w) {      	
				ull tmp = *q * *w % P;
				*q = *p + P - tmp;
				*p += tmp;
			}
		}	
	}
	for (int i = 0; i < n; ++i) {
		a[i] %= P;
	}
}
poly operator*(const poly &a, const poly &b) {
	static ull f[L], g[L];
	int len = a.size() + b.size() - 1;
	int n = extend(len);
	for (int i = 0; i < n; ++i) {
		f[i] = i < (int) a.size() ? a[i] : 0;
		g[i] = i < (int) b.size() ? b[i] : 0;
	}
	dft(f, n);
	dft(g, n);
	for (int i = 0; i < n; ++i) {
		f[i] = Mul(f[i], g[i]);
	}
	reverse(f + 1, f + n);
	dft(f, n);
	int coef = power(n, P - 2);
	poly c(len);
	for (int i = 0; i < len; ++i) {
		c[i] = Mul(f[i], coef);
	}
	return c;
}
const int N = 531441, M = 18816780; 
long long n;
int x, y, z, px[M], py[70], coef[M];
int main() {
	set_up();
	cin >> n >> x >> y >> z;
	int m = n / N;
	int x1 = power(x, N), z1 = Mul(z, z);
	px[0] = 1;
	for (int i = 1; i < m; ++i) {
		px[i] = Mul(px[i - 1], x1);
	}
	py[0] = 1;
	for (int i = 1; i < 70; ++i) {
		py[i] = Mul(py[i - 1], y);
	}
	coef[0] = 1;
	for (int i = 1; i < M; ++i) {
		if (i % 3 == 0) {
			coef[i] = coef[i / 3];
		} else {
			coef[i] = Mul(coef[i / 3], (i % 3 == 1) ? z : z1);
		}
	}
	poly f0(1 << 20), f1(1 << 20);
	for (int i = 0; i < m; ++i) {
		long long x = 1ll * i * N;
		int val = Mul(px[i], coef[i]);
		int high = x >> 20, low = x & ((1 << 20) - 1);
		add(f0[low], Mul(val, py[__builtin_popcount(high)]));
		add(f1[low], Mul(val, py[__builtin_popcount(high + 1)]));
	}
	poly g(N);
	int pw = 1;
	for (int i = 0; i < N; ++i) {
		g[i] = Mul(pw, coef[i]);
		mul(pw, x);
	}
	f0 = f0 * g;
	f1 = f1 * g;
	int ans = 0;
	for (int i = 0; i < 1 << 20; ++i) {
		int coef = py[__builtin_popcount(i)]; 
		add(ans, Mul(f0[i], coef));
		if (i < N - 1) {
			add(ans, Mul(f1[i + (1 << 20)], coef));
		}
	}
	long long cur = 1ll * m * N;
	int p1 = power(x1, m);
	for (int i = 0; cur <= n; ++cur, ++i) {
		int p2 = py[__builtin_popcountll(cur)] % P;
		int p3 = Mul(coef[m], coef[i]);
		add(ans, Mul(p1, Mul(p2, p3)));
		mul(p1, x);
	}
	sub(ans, 1);
	cout << ans << "\n";
	return 0;
}