#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define int int64_t

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pi pair<int, int>
#define vi vector<int>
#define pb push_back
#define all(x) (x).begin(), (x).end()

template <typename T>
istream &operator>>(istream &in, vector<T> &v)
{
    for (auto &x : v)
        in >> x;
    return in;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v)
{
    for (const auto &x : v)
        out << x << ' ';
    return out;
}

template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p)
{
    in >> p.first >> p.second;
    return in;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p)
{
    out << p.first << ' ' << p.second;
    return out;
}

const int MOD = 998244353;
const int N = 200001;


void solve()
{
    int n; cin >> n;
    int k = 2 * (n >> 1);
    vector<int> a(N, 0), prev(N, 0);
    prev[0] = 1;
    for (int i = 0; i < n; i++)
    {
        a[0] = prev[1];
        a[1] = 2 * prev[0] + prev[2];
        a[n - 1] = prev[n - 2];
        for (int j = 2; j < n - 1; j++)
            a[j] = prev[j - 1] + prev[j + 1];
        for (int j = 0; j < n; j++)
            prev[j] = a[j];
    }
    for (int i = 0; i <= n; i++)
        cout << a[i] << " ";
    cout << '\n';
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t = 1;
    while (t--)
        solve();

    return 0;
}