#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    long long P;
    cin >> P;
    vector<long long> pow10(P+1);
    pow10[0] = 1;
    for (int i=1; i<=P; i++) pow10[i] = pow10[i-1] * 10;

    vector<vector<long long>> dp(P+1, vector<long long>(3));
    dp[0][0] = 1;

    for (int i=1; i<=P; i++){
        for (int j=0; j<3; j++){
            for (int k=0; k<=9; k++){
                if (k != 3) dp[i][j] += dp[i-1][(3+j-k%3)%3];
                else dp[i][j] += pow10[i-1];
            }
        }
    }
    
    cout << dp[P][0]-1 << endl;

    return 0;
}