ИТМО_комбинаторно

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}

#include <fstream>
vector <int> F(10,1);

int C(int n, int k){
    return F[n] / (F[k] * F[n - k]);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for (int i = 2; i <= 9; ++i){
        F[i] = F[i - 1] * i;
    }
    ll ans=5;
    vector <int> v = {2, 4, 6, 8};
    for (int i: v){
        for (int n = 1; n <= i; ++n){
            for (int k = 1; k <= n; ++k){
                ans += C(n - 1, k - 1);
            }
        }
    }
    cout<<ans;
}