#include #include using namespace std; const long long MOD = 1000000007; template struct ModInt{ int n; ModInt():n(0){} ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){} ModInt &operator+=(const ModInt &p){ if((n+=p.n) >= mod)n-=mod; return *this; } ModInt &operator-=(const ModInt &p){ n+=mod-p.n; if(n >= mod)n-=mod; return *this; } ModInt &operator*=(const ModInt &p){ n = (int) ((1LL*n*p.n)%mod); return *this; } ModInt &operator/=(const ModInt &p){ *this *= p.inverse(); return *this; } ModInt operator-() const {return ModInt(-n);} ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;} ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;} ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;} ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;} bool operator==(const ModInt &p) const {return n==p.n;} bool operator<(const ModInt &p) const {return n(const ModInt &p) const {return n>p.n;} bool operator>=(const ModInt &p) const {return n>=p.n;} bool operator<=(const ModInt &p) const {return n<=p.n;} bool operator!=(const ModInt &p) const {return n!=p.n;} ModInt inverse() const { int a = n,b = mod,u = 1,v = 0; while(b){ int t = a/b; a -= t*b; swap(a,b); u -= t*v; swap(u,v); } return ModInt(u); } ModInt pow(int64_t z) const { ModInt ret(1),mul(n); while(z > 0){ if(z & 1) ret *= mul; mul *= mul; z >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p){ return os << p.n; } friend istream &operator>>(istream &is, ModInt &a){ int64_t t; is >> t; a = ModInt (t); return (is); } }; using mint = ModInt; template struct mat{ vector> x; int h,w; mat():x(vector>()){} mat(int h,int w):x(vector>(h,vector(w))),h(h),w(w){} mat(int h,int w, T c):x(vector>(h,vector(w,c))),h(h),w(w){} mat(vector> A):x(A),h(A.size()),w(A[0].size()){} vector& operator[](int i){return x[i];} mat& operator*=(mat& y){ mat ret(h,y.w,0); if(w != y.h){ for(int i = 0; h > i; i++){ for(int j = 0; y.w > j; j++){ ret[i][j] = -1; } } }else{ for(int i = 0; h > i; i++){ for(int j = 0; y.w > j; j++){ for(int k = 0; w > k; k++){ ret[i][j] = ret[i][j] + x[i][k]*y[k][j]; } } } } for(int i = 0; h > i; i++){ x[i].resize(y.w); } w = y.w; for(int i = 0; h > i; i++){ for(int j = 0; y.w > j; j++){ x[i][j] = ret[i][j]; } } return *this; } mat operator*(mat& y){return mat(*this) *= y;} mat pow(long long n){//正方行列のみ mat res(h,w); mat ret(h,w,0); mat a(h,w); for(int i = 0; h > i; i++){ ret[i][i] = 1; } for(int i = 0; h > i; i++){ for(int j = 0; w > j; j++){ a[i][j] = (*this)[i][j]; } } while(n > 0){ if(n & 1){ ret *= a; } a *= a; n/=2; } for(int i = 0; h > i; i++){ for(int j = 0; w > j; j++){ res[i][j] = ret[i][j]; } } return res; } friend ostream &operator<<(ostream &os, const mat &m){ for(int i = 0; m.h > i; i++){ for(int j = 0; m.w > j; j++){ os << m.x[i][j]; if(j+1 != m.w)cout << " "; } if(i+1 != m.h)cout << "\n"; } return os; } }; int main(){ long long n;cin>>n; mat A(3,3); A[0][0] = A[1][1] = 100; A[2][0] = A[2][1] = A[2][2] = 1; mat B(1,3); B[0][0] = 0; B[0][1] = 1; B[0][2] = 1; A = A.pow(n); cout << (B*A)[0][0] << endl; n=(n-1)%9; for(int i = 0; n > i; i++){ cout << "10"; } cout << "1" << endl; }