#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
const int maxn=1e6+10;
const int mod=998244353;
string s;
int n,a[maxn],f[maxn][3][3][2];
/*
0 -> None
1 -> 0
2 -> 4
*/
int dfs(int x,int lst,int llst,bool flg){
    if(!x) return 1;
    if(~f[x][lst][llst][flg]) return f[x][lst][llst][flg];
    int up=(flg?a[x]:9),res=0;
    for(int i=0;i<=up;i++){
        if(lst==1&&llst==2&&i==4) continue;
        int num=((i==4)?2:(i==0?1:0));
        res=(res+dfs(x-1,num,lst,flg&(i==a[x])))%mod; 
    }
    return f[x][lst][llst][flg]=res;
}
void solve(){
    cin>>s,n=s.size(),s=" "+s,memset(f,-1,sizeof f);
    for(int i=1;i<=n;i++) a[i]=(s[n-i+1]-'0');
    cout<<(dfs(n,0,0,1)-1+mod)%mod<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
??freopen???????
????
????????????
*/