#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n;
ll memo[22][3][2];

ll dp(int i,int r,bool flag){
  if (memo[i][r][flag]!=-1) return memo[i][r][flag];
  if (i==0){
    if (r==0 && flag==0) return 1;
    else return 0;
  }
  ll res=0;
  rep(k,10){
    if (k!=3){
      res+=dp(i-1,(r-k+9)%3,flag);
    }
    if (k==3){
      if (flag){
        res+=dp(i-1,r,1)+dp(i-1,r,0);
      }
    }
  }
  memo[i][r][flag]=res;
  //cout << i << " " << r << " " << flag << " " << res << endl;
  return res;
}

void solve(){
  cin >> n;
  rep(i,n+1){
    rep(r,3){
      rep(f,2){
        memo[i][r][f]=-1;
      }
    }
  }
  cout << dp(n,0,1)+dp(n,0,0)+dp(n,1,1)+dp(n,2,1)-1 << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}