#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(),(x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define TEN(n) ((ll)(1e##n)) #define fst first #define snd second string DBG_DLM(int &i){return(i++==0?"":", ");} #define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;} templateostream&operator<<(ostream&os,vectorv); templateostream&operator<<(ostream&os,setv); templateostream&operator<<(ostream&os,queueq); templateostream&operator<<(ostream&os,priority_queueq); templateostream&operator<<(ostream&os,pairp); templateostream&operator<<(ostream&os,mapmp); templateostream&operator<<(ostream&os,unordered_mapmp); templatevoid DBG(ostream&os,TPL t){} templatevoid DBG(ostream&os,TPL t){os<<(I==0?"":", ")<(t);DBG(os,t);} templatevoid DBG(ostream&os,pairp,string delim){os<<"("<ostream&operator<<(ostream&os,tuplet){os<<"(";DBG<0,tuple,Ts...>(os,t);os<<")";return os;} templateostream&operator<<(ostream&os,pairp){DBG(os,p,", ");return os;} templateostream&operator<<(ostream&os,vectorv){DBG_B(forr(t,v){os<ostream&operator<<(ostream&os,sets){DBG_B(forr(t,s){os<ostream&operator<<(ostream&os,queueq){DBG_B(for(;q.size();q.pop()){os<ostream&operator<<(ostream&os,priority_queueq){DBG_B(for(;q.size();q.pop()){os<ostream&operator<<(ostream&os,mapm){DBG_B(forr(p,m){os<");});} templateostream&operator<<(ostream&os,unordered_mapm){DBG_B(forr(p,m){os<");});} #define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name #define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<;using pll=pair;using pil=pair;using pli=pair; using vs=vector;using vvs=vector;using vvvs=vector; using vb=vector;using vvb=vector;using vvvb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; templatebool amax(T&a,const T&b){return abool amin(T&a,const T&b){return a>b?a=b,1:0;} ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;} vl p10; long long toModInt(const string &s, const long long mod) { long long ret = 0; long long pw = 1; int n = (int) s.size(); for (int i = n - 1; i >= 0; i--) { int c = s[i] - '0'; (ret += pw * c) %= mod; (pw *= 10) %= mod; } return ret; } string dec(string S) { int bollow = 1; for (int i = S.length() - 1; i >= 0; i--) { int p = S[i] - '0'; if (p - bollow < 0) { S[i] = '9'; bollow = 1; } else { S[i] = (p - bollow) + '0'; break; } } return S; } ll keta(int n, const ll mod) { ll ans = 0; rep(i, 1, n+1) { (ans += 9 * p10[(i+1)/2-1]) %= mod; } return ans; } ll solve(const string &s, ll mod) { int n = sz(s); if (n == 1) { return s[0] - '0'; } p10.clear(); { ll p = 1; rep(i, n+1) { p10.emplace_back(p); (p*=10) %= mod; } } out(p10); ll ret1 = keta(n-1, mod); out(n, ret1); int m = (n+1) / 2; bool flg = true; rrep(i, m) { int j = m+(m-i-1); out(i, s[i], s[j]); if (s[i] < s[j]) { flg = true; break; } if (s[i] > s[j]) { flg = false; break; } } auto t = s.substr(0, m); out(s, t, flg); t = dec(t); ll ans2 = flg; ans2 += toModInt(t, mod); out(s, n, t, m); out(ans2); return (ret1 + ans2) % mod; } void Main() { auto s = rs(); cout << solve(s, TEN(9)) << endl; cout << solve(s, TEN(9)+7) << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }