//2024.4.11
//https://www.lanqiao.cn/problems/2107/learning/
//修剪灌木
/*
思路:自己写的AC代码
*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> PII;
const int N = 1e4;
int n;
int a[N];
signed main()
{
cin>>n;
for(int i=1;i<=n;i++){
a[i] = max(2*(i-1), (n-i)*2);
}
for(int i=1;i<=n;i++) cout<<a[i]<<endl;
return 0;
}