/* -*- coding: utf-8 -*-
 *
 * 220.cc: No.220 世界のなんとか2 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 19;

/* typedef */

typedef long long ll;

/* global variables */

ll dp0[MAX_P + 1][3], dp1[MAX_P + 1][3];

/* subroutines */

/* main */

int main() {
  int p;
  cin >> p;

  dp0[0][0] = 1;

  for (int i = 0; i < p; i++)
    for (int j = 0; j < 3; j++)
      for (int di = 0; di < 10; di++) {
	int k = (j + di) % 3;
	if (di == 3)
	  dp1[i + 1][k] += dp0[i][j] + dp1[i][j];
	else
	  dp0[i + 1][k] += dp0[i][j], dp1[i + 1][k] += dp1[i][j];
      }

  ll sum = dp0[p][0];
  for (int i = 0; i < 3; i++) sum += dp1[p][i];

  printf("%lld\n", sum - 1);
  return 0;
}