#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int P, pz;
string p = "1";
ll dp[21][2][2][3];

int main() {
  cin >> P;
  while (P--) p += "0";
  pz = p.size();

  dp[0][0][0][0] = 1;
  for (int i = 0; i < pz; i++) {
    int D = p[i] - '0';
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 2; k++) {
        for (int l = 0; l < 3; l++) {
          for (int d = 0; d <= (j ? 9 : D); d++) {
            dp[i + 1][j || (d < D)][k || (d == 3)][(l + d) % 3] += dp[i][j][k][l];
          }
        }
      }
    }
  }

  ll ans = 0;
  for (int j = 0; j < 2; j++) {
    for (int k = 0; k < 2; k++) {
      for (int l = 0; l < 3; l++) {
        if (k || !l) {
          ans += dp[pz][j][k][l];
        }
      }
    }
  }
  cout << ans - 1 << endl;

  return 0;
}