#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int mod=998244353;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}

vector <int> build_fail(string s) {
  vector <int> f(s.size() + 1, 0);
  int k = 0;
  for (int i = 1; i < (int)s.size(); ++i) {
    while (k && s[k] != s[i]) k = f[k];
    if (s[k] == s[i]) k++;
    f[i + 1] = k;
  }
  return f;
}

int n;
string s;

void amano_hina_is_the_goat(){
    cin >> s;
    n=sz(s);
    vector<int> vec(n+1);
    int inv10=Pow(10);
    vec[n]=add(vec[n],1);
    vector<int> f=build_fail(s);
    for(int i=n; i>0; i=f[i]){
        vec[n-i]=add(vec[n-i],1);
        vec[n-i+1]=sub(vec[n-i+1],10);
    }
    for(int i=0,cur=1; i<=n; ++i,cur=mul(cur,inv10)){
        vec[i]=mul(vec[i],cur);
    }
    int val=0,val2=0;
    for(int i=0; i<=n; ++i){
        val=add(val,vec[i]);
        val2=add(val2,mul(i,vec[i]));
    }
    int res=mul(sub(val,val2),Pow(mul(val,val)));
    res=mul(res,Pow(inv10,n));
    cout << res << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cout << fixed << setprecision(20);
    int t=1; //cin >> t;
    while(t--) amano_hina_is_the_goat();
}