#include <bits/stdc++.h>

#define mp       make_pair
#define mt	 make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    pair<int,int>      pii;
typedef    pair<long,long>    pll;

const int INF=1<<29;
const double EPS=1e-9;
const int MOD = 100000007;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int N;
ll dp[21][3][2][2];//pos, div, three, less
ll solve(){
  memset(dp, 0, sizeof(dp));
  dp[0][0][0][0] = 1;
  for (int i = 0; i < N; i++){
    for (int j = 0; j < 3; j++){
      for (int k = 0; k < 2; k++){
	for (int m = 0; m < 2; m++){//0 equal 1 determine less
	  int digit = (i == 0 ? 1 : 0);
	  if (dp[i][j][k][m] == 0)continue;
	  for (int l = 0; l <= 9; l++){
	    if (m == 0){
	      if (l > digit)continue;
	      if (l == digit){
		dp[i + 1][(10 * j + l) % 3][k][0] += dp[i][j][k][m];
	      }else{
		dp[i + 1][(10 * j + l) % 3][k][1] += dp[i][j][k][m];
	      }
	    }else{
	      if (l == 3){
		dp[i + 1][(10 * j + l) % 3][1][m] += dp[i][j][k][m];
	      }else{
		dp[i + 1][(10 * j + l) % 3][k][m] += dp[i][j][k][m];
	      }
	    }
	  }
	}
      }
    }
  }
  ll res = 0;

  for (int j = 0; j < 2; j++){
    res += dp[N][0][1][j];
    res += dp[N][1][1][j];
    res += dp[N][2][1][j];
    res += dp[N][0][0][j];
  }

  cout << res - 1<< endl;
}
int main(){
  cin >> N;
  N++;
  solve();
}