#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
using ll = mint;
int nxt(int bit, int t) {
	int ret = bit;
	if (bit & (1 << t)) {
		ret &= ~(1 << t);
	} else {
		ret |= (1 << t);
	}
	return ret;
}
int main()  {
	string X;cin >> X;
	int N = X.size();
	vector<vector<ll>> dp(1024, vector<ll>(2, 0));
	for (int i = 0;i < N;i++) {
		int nt = X[i] - '0';
		vector<vector<ll>> ndp(1024, vector<ll>(2, 0));
		if (i == 0) {
			for (int c = 1;c < nt;c++) ndp[nxt(0, c)][1]++;
			ndp[nxt(0, nt)][0]++;
			swap(dp, ndp);
			continue;
		}
		//leadin zero
		for (int c = 1;c < 10;c++) ndp[nxt(0, c)][1]++;
		for (int bit = 0;bit < 1024;bit++) {
			//from sml = true
			for (int c = 0;c < 10;c++) {
				ndp[nxt(bit, c)][1] += dp[bit][1];
			}
			//from sml = false;
			for (int c = 0;c < nt;c++) ndp[nxt(bit, c)][1] += dp[bit][0];
			ndp[nxt(bit, nt)][0] += dp[bit][0];
		}
		swap(dp, ndp);
	}
	cout << mint(dp[0][0] + dp[0][1]).val() << endl;
}