#include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } vector bitconversion(ll i, ll n, ll N) { ll x = 1; rep(j, N) { x *= n; } vector vec(N); rep(j, N) { x /= n; vec[j] = i / x; i -= x * vec[j]; } return vec; } int main(){ ll N; cin >> N; ll num = 1; for (ll i = 0; i < N; i++){ num *= 26; } ll ans = 0; for (ll i = 0; i < num; i++){ vector bin = bitconversion(i, 26, N); string S = ""; for (ll j = 0; j < N; j++){ S += (char)(bin[j] + 'a'); } ll state = 0; ll cnt = 0; for (ll j = 0; j < N; j++){ if (state == 0 && S[j] == 'c') state = 1; else if (state == 1 && S[j] == 'o') state = 2; else if (state == 2 && S[j] == 'n'){ state = 0; cnt++; } } ans += cnt; } cout << ans << endl; }