#include <bits/stdc++.h>

using namespace std;
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define int long long
#define ll long long
#define ld long double

#define rep(i, n) for (ll i=0; i<n; i++)
#define repi(i, n) for (ll i=1; i<=n; i++)

#define repi1(i, n) for (ll i = n; i >=0; i--)
#define mem(v, ha) memset(v, ha, sizeof(v))
#define all(a)  a.begin(), a.end()
#define allr(a)  a.rbegin(), a.rend()
#define CLOCK cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
typedef vector<ll> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<ll, ll>> vpi;
typedef vector<char> vc;
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define mp make_pair
#define ff first
#define ss second
const ll MOD = 1e9 + 7;
const ll mod = 998244353 ;

const long double PI = 3.141592653589793238460;
const int inf = (int)(1e9);

// auto sum=[&](int use, int y){return use+y;};
// function <void(int)>dfs=[&](int u)  //void is the return type, int is the argument

void solve()
{
    int M;
    cin >> M;
    vvi f(M + 1);
    for (int i = 1; i <= M; i++)
    {
        for (int j = i; j <= M; j += i)
        {
            f[j].pb(i);
        }
    }
    //first element j
    //j*(1+2+...)=i
    vector<long long> dp(M + 1);
    dp[0] = 1;
    for (int i = 1; i <= M; i++) {
        for (int j : f[i]) {
            dp[i] += dp[i / j - 1];
            if (dp[i] >= MOD) {
                dp[i] -= MOD;
            }
        }
    }
    for (int i = 1; i <= M; i++)
        cout << dp[i] << " ";
    cout << dp[M] << endl;
}
int32_t main()
{



    fast_io;
    int T = 1;
   // cin >> T;

    while (T--)
    {
        solve();


    }

}