#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

#define REP(i,n)	for(int i=0;i<(n);++i)
#define REPS(i,s,t)	for(int i=(s);i<(t);++i)

#define INF 		2000000007
//#define MOD			1000000007
#define MAX 		100005

const int MOD	=	1000000007;

typedef unsigned int 			uint;
typedef unsigned long long int	ull;
typedef long long int ll;

//uint dp[MAX];

long pow(long x, ull n) { //x^n 計算量O(logn)
	long ans = 1;
	while (n > 0) {
		if ((n & 1) == 1) 
			ans = (ans * x)%MOD;
		x = (x * x)%MOD; //一周する度にx, x^2, x^4, x^8となる
		n >>= 1; //桁をずらす n = n >> 1
	}
	return ans;
}

int main(){
	ull N;cin>>N;

	int inv99 = pow(99,MOD-2);
	cout << (((1LL*pow(100,N)-1)*inv99)%MOD) << endl;
	ull ans = 1;
	REPS(i,1,N%11){
		ans = ans*100+1;
	}
	cout << ((N%11) ? ans : 0) << endl;
}