#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 sz = s.size();
	vector dp(sz + 1, vector(2, vector<mint>(4)));
	// *
	// 4
	// 40
	vector<int>nx = { 4,0,4 };
	dp[0][0][0] = 1;
	rep(i, sz) {
		int ni = i + 1;
		auto update = [&](int p, int q, int num)->void {
			rep(t, 3) {
				if (nx[t] == num) {
					dp[ni][q][t + 1] += dp[i][p][t];
				}
				else if (1 == t && 4 == num) {
					dp[ni][q][1] += dp[i][p][t];
				}
				else {
					dp[ni][q][0] += dp[i][p][t];
				}
			}
		};
		{// 00
			update(0, 0, s[i] - '0');
		}
		{// 01
			rep(j, s[i] - '0')update(0, 1, j);
		}
		{// 11
			rep(j, 10)update(1, 1, j);
		}
	}
	mint ans = 0;
	rep(i, 2)rep(j, 3)ans += dp[sz][i][j];
	ans--;
	cout << ans.val() << endl;
	return 0;
}