#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const int mod = 1e9+7;
const int N = 2e5+10;
int dp[2020][2020];
int rec(int n , int k)
{
    if (n <= 0)
        return 0;
    int &ret = dp[n][k];
    if (ret + 1)return ret;
    int maxx = 0;
    for (int i = 1 ; i <= k*2 ; ++i)
        maxx = max(maxx , 1 - rec(n - i , i));
    return ret = maxx;
}
int main ()
{
    //cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
    /*
    memset(dp , -1 , sizeof dp);
    for (int i = 2 ;i <= 2000 ; ++i)
    {
        int maxx = 0;
        for (int j = 1 ; j < i ; ++j)
            maxx = max(maxx , 1 - rec(i-j , j));
        if (!maxx)
            cout << i << '\n';
    }*/
    cout << "2\n3\n5\n8\n13\n21\n34\n55\n89\n144\n233\n377\n610\n987\n1597";

return 0;
}