#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[25][3][2];
ll solve(int dig, int mod, int used){
  if(dig == 0){
    return (mod == 0 || used);
  }
  if(dp[dig][mod][used] != -1){
    return dp[dig][mod][used];
  }
  ll res = 0;
  for(int d=0;d<10;d++){
    res += solve(dig - 1, (mod + d) % 3, used | (d == 3));
  }
  return dp[dig][mod][used]=res;
}

int main(){
  memset(dp, -1, sizeof(dp));
  
  int P;
  cin >> P;

  ll res = solve(P, 0, 0) - 1;
  cout << res << endl;
  
  return 0;
}