#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	int n = s.size();
	int bit = 1 << 10;
	vector dp(bit, vector<mint>(2));
	dp[1 << (s[0] - '0')][0] = 1;
	rep2(i, 1, s[0] - '0') dp[1 << i][1] = 1;
	rep2(i, 1, n) {
		vector ndp(bit, vector<mint>(2));
		rep2(j, 1, 10) ndp[1 << j][1]++;
		rep(j, bit) {
			int num = s[i] - '0';
			// 0->0
			int nj = j ^ (1 << num);
			ndp[nj][0] += dp[j][0];
			// 0->1
			rep(k, num) {
				int nj = j ^ (1 << k);
				ndp[nj][1] += dp[j][0];
			}
			// 1->1
			rep(k, 10) {
				int nj = j ^ (1 << k);
				ndp[nj][1] += dp[j][1];
			}
		}
		swap(dp,ndp);
	}
	mint ans = 0;
	rep(j, 2)ans += dp[0][j];
	cout << ans.val() << endl;
	return 0;
}