#pragma GCC optimize ("O3") #include "bits/stdc++.h" using namespace std; using ll = long long int; #define debugos cout #define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)< ",__LINE__,#v);for(auto e:(v)){debugos< ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<::type>::type cnt=0;(cnt)<(l);++(cnt)) #define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt)) #define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt)) #define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt)) const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L; inline void assert_call(bool assertion, function f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } } template inline ostream& operator <<(ostream &o, const pair p) { o << '(' << p.first << ':' << p.second << ')'; return o; } template inline ostream& _ostream_vecprint(ostream& os, const Vec& a) { os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; } template inline ostream& operator<<(ostream& o, const vector& v) { return _ostream_vecprint(o, v); } template inline ostream& operator<<(ostream& o, const array& v) { return _ostream_vecprint(o, v); } template inline T& maxset(T& to, const T& val) { return to = max(to, val); } template inline T& minset(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(code); } mt19937_64 randdev(8901016); template inline T rand(T l, T h) { return uniform_int_distribution(l, h)(randdev); } template<> inline double rand(double l, double h) { return uniform_real_distribution(l, h)(randdev); } template<> inline float rand(float l, float h) { return uniform_real_distribution(l, h)(randdev); } template T pow_md(T x, T p, T mod = MD) { T y = 1; x = x % mod; for (; 0 < p; p >>= 1) { if (p & 1) y = y * x % mod; x = x * x % mod; } return y; } // const ll ioi = 101010101010101010101ll; // factor: 11 23 4093 8779 21649 513239 int main() { ll N; cin >> N; ll inv99 = pow_md(99ll, MD - 2, MD); cout << ((pow_md(100ll, N, MD)*inv99-inv99+MD)%MD) << endl; ll n = (N - 1) % 11; if (n == 10) cout << '0' << endl; else { cout << '1'; repeat(i, n) cout << '0' << '1'; cout << endl; } return 0; }