#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 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;} ll mod1 = 1e9; ll mod2 = 1e9+7; vl p10; 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, const ll mod) { int n = sz(s); 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); if (n%2 == 0) { int m = n / 2; auto t = s.substr(0, m); t[0]--; ll ans2 = 0; ll p = 1; rrep(i, m) { int c = t[i]-'0'; out(i, c); (ans2 += p * c) %= mod; (p *= 10) %= mod; } out(s, n, t, m); out(ans2); return (ret1 + ans2) % mod; } else { int m = (n+1) / 2; auto t = s.substr(0, m); t[0]--; ll ans2 = 0; ll p = 1; rrep(i, m) { int c = t[i]-'0'; out(i, c); (ans2 += p * c) %= mod; (p *= 10) %= mod; } out(s, n, t, m); out(ans2); return (ret1 + ans2) % mod; } //return (ret1+ret3) % mod; } void Main() { auto s = rs(); cout << solve(s, mod1) << endl; cout << solve(s, mod2) << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }