#include #define EPS 1e-9 #define INF 1070000000LL #define MOD 1000000007LL #define fir first #define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++) #define numa(x,a) for(auto x: a) #define ite iterator #define mp make_pair #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define pb push_back #define pf push_front #define sec second #define sz(x) ((int)(x).size()) #define ALL( c ) (c).begin(), (c).end() #define gcd(a,b) __gcd(a,b) #define mem(x,n) memset(x,n,sizeof(x)) #define endl "\n" using namespace std; template void deploy(std::ostream &os, const TUPLE &tuple){} template void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get(t); deploy(os, t); } template std::ostream& operator<<(std::ostream &os, std::pair &p){ os << "(" << p.first <<", " << p.second <<")";return os; } template std::ostream& operator<<(std::ostream &os, std::vector &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template std::ostream& operator<<(std::ostream &os, std::set &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template std::ostream& operator<<(std::ostream &os, std::map &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; } #define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; } #define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); } #define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); } #define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); } using ll = long long; int P; ll memo[40][2][4][3];//(has3, mod3,has3 and mod3) void dp_go(int now, bool has3, int mod){ if (now == P) { ll x = 0; ll y = 0; ll z = 0; if (has3) { x = 1; } if (mod == 0) { y = 1; } if (x == 1 && y == 1) { z = 1; } memo[now][has3][mod][0] = x; memo[now][has3][mod][1] = y; memo[now][has3][mod][2] = z; return; } if (memo[now][has3][mod][0] != -1){ return; } ll ret[3] = {}; rep(i,10){ int nnow = now + 1; int nmod = (mod + i) % 3; bool nhas3 = has3; if (i == 3) { nhas3 = true; } dp_go(nnow, nhas3, nmod); rep(k,3){ ret[k] += memo[nnow][nhas3][nmod][k]; //DEBUG3(i,k,ret[k]); } } rep(k,3){ memo[now][has3][mod][k] = ret[k]; } return; } int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> P; rep(i,30){ rep(j,2){ rep(k,4){ memo[i][j][k][0] = -1; } } } dp_go(0,false,0); auto z1 = memo[0][false][0][0]; auto z2 = memo[0][false][0][1]; auto z3 = memo[0][false][0][2]; cout << z1 + z2 - z3 - 1 << endl; return 0; }