#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
#define dp_size 1000001
LL N;
LL a[1000001];//100^x
LL solve(LL x,LL mod){//x^100を求める
   //cout<<x<<"aa"<<endl;
   a[0]=100;
   //a[1]=100;
   for(int i=1;i<100;i++){
       a[i]=(a[i-1]*a[i-1])%mod;
   }
   LL ans=1;
   LL count=0;
   while(x>0){
      if(x%2==1){
         ans=(ans*a[count])%mod;
      }
      count++;
      x/=2;
   }
   //cout<<ans<<"bbb"<<endl;;
   return ans;
}
LL dp[dp_size];
LL solve2(LL x,LL mod){
   if(x==1)return 1;
   if(x==2)return 101;
   //cout<<"a"<<endl;
   if(x<dp_size){
      //cout<<x<<"b"<<dp[x]<<endl;
      if(dp[x]!=-1)return dp[x];
   }
   LL temp;
  // cout<<"c"<<endl;
   temp=solve2((x+1)/2,mod);
  // cout<<"d"<<endl;
   temp*=solve(x/2,mod);
  // cout<<"e"<<endl;
   temp+=solve2(x/2,mod);
   temp%=mod;
  // cout<<"f"<<endl;
   if(x<1000001){
      dp[x]=temp;
   }
   return temp;
}
int main(){
        memset(dp,-1,sizeof(dp));
	LL N;
	cin>>N;
	/*REP(i,9){
	    cout<<solve2(6,10000000000000007)<<endl;
	}*/
        cout<<solve2(N,1000000007)<<endl;
        if(N%11==0){
           cout<<0<<endl;
           return 0;
        }
        REP(i,N%11-1){
            cout<<"10";
        }
        cout<<"1"<<endl;
	return(0);
}