import java.util.Arrays; import java.util.Scanner; import java.util.concurrent.SynchronousQueue; import java.math.*; public class Main { public static void main(String[] args) { new Main().run(); } static long[][] mx = { { 100, 1 }, { 1, 0 } }; static long MODULO = 1000000007; BigInteger MODULO2 = new BigInteger("101010101010101010101"); static BigInteger[] arr = new BigInteger[100]; void run() { Scanner sc = new Scanner(System.in); long N = sc.nextLong(); System.out.println((pow(100, N) - 1 + MODULO) * (pow(99, MODULO - 2) % MODULO) % MODULO); BigInteger a = new BigInteger("0"); arr[0] = a; for (int i = 1; i < arr.length; ++i) { arr[i] = arr[i - 1].multiply(BigInteger.valueOf(100)).add(BigInteger.ONE).mod(MODULO2); } System.out.println(arr[(int) (N % 11)]); } long pow(long a, long n) { long ret = 1; for (; n > 0; n >>= 1, a = (a * a) % MODULO) { if (n % 2 == 1) { ret *= a; ret %= MODULO; } } return ret; } long[][] mul(long[][] a, long[][] b) { if (a[0].length != b.length) throw new AssertionError(); long[][] ret = new long[a.length][b[0].length]; for (int i = 0; i < a.length; ++i) { for (int j = 0; j < b[0].length; ++j) { for (int k = 0; k < a[j].length; ++k) { ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % MODULO; } } } return ret; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }