#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;

ll dp[30][3][2];

int main() {
  int P;
  cin >> P;
  dp[0][0][0] = 1;
  rep(i, P) rep(j, 3) rep(k, 2) rep(d, 10) {
    dp[i + 1][(j + d) % 3][k || d == 3] += dp[i][j][k];
  }
  ll ans = 0;
  rep(j, 3) rep(k, 2) {
    if (j == 0 || k)
      ans += dp[P][j][k];
  }
  cout << ans - 1 << endl;
  return 0;
}