#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	string n; cin >> n;
	vector<int> a;
	rep(i,0,(int)n.size()){
		a.push_back(n[i] - '0');
	}

	vector<mint> dp(1024);
	int tmp = 0;

	rep(num,0,(int)n.size()){
		vector<mint> ndp(1024);

		rep(i,0,1024){
			rep(j,0,10){
				ndp[i^(1<<j)] += dp[i];
			}
		}
		
		if (num > 0){
			rep(i,1,10){
				ndp[1<<i] += 1;
			}
		}

		rep(i,num<1,a[num]){
			ndp[tmp^(1<<i)] += 1;
		}

		tmp ^= 1 << a[num];
		dp = ndp;
	}

	dp[tmp] += 1;
	cout << dp[0].val() << '\n';
}