S_N2

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
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>

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string data;
    ifstream file(".txt");
    vector <int> dp(41, 0);
    dp[1] = 1;
    for (int i = 2; i <= 12; ++i) {
        vector <int> id = {i-1};
        if (i % 2 == 0) {
            id.pb(i / 2);
        }
        if (i % 3 == 0) {
            id.pb(i / 3);
        }
        for (int j: id) {
            dp[i] += dp[j];
        }
    }
    for (int i = 13; i <= 40; ++i) {
        if (i == 14) {
            continue;
        }
        vector <int> id = {i - 1};
        if (i % 2 == 0) {
            id.pb(i / 2);
        }
        if (i % 3 == 0) {
            id.pb(i / 3);
        }
        for (int j: id) {
            if (j >= 12) {
                dp[i] += dp[j];
            }
        }
    }
    cv(dp);
}