#include <bits/stdc++.h>
using namespace std;

typedef long long ll ;

ll a[3100]={0,1};
int n;
int k = 1;//a数组的当前长度

int fd(ll m)
{
    for(int i = 1; i <= k;i++)
    {
        if(m == a[i])return i;
    }
    return -1;
}
int main()
{
    cin>>n;
    for(int i = 2; i <= n;i++)
    {
        //cout<<a[i]<<endl;
        ll t1 = a[i-1] - i;
        ll t2 = a[i-1] + i;
        if(t1 > 0 and fd(t1) == -1)a[i] = t1;
        else a[i] = t2;
        k++;
    }
    sort(a+1,a+k+1);
    for(int i = 1; i <= k;i++)
    {
        cout<<a[i]<<' ';
    }

    return 0;
}