#include <cstdio>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int main(void) {
  int p; scanf("%d", &p);
  p -= 1;
  vector<vector<vector<i64>>> dp(p+1, vector<vector<i64>>(2, vector<i64>(3)));
  dp[0][0] = {2, 3, 3};
  dp[0][1] = {1, 0, 0};
  for(int i : range(p)) {
    for(int k : range(3)) {
      for(int d : range(10)) {
        dp[i+1][d==3][(k+d)%3] += dp[i][0][k];
        dp[i+1][1]   [(k+d)%3] += dp[i][1][k];
      }
    }
  }
  i64 res = 0;
  for(int i : range(p+1)) {
    for(int k : range(3)) {
      res += dp[i][1][k];
    }
    res += dp[i][0][0];
  }
  printf("%lld\n", res);
  return 0;
}