#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <cstring>
#include <queue>
#include <bitset>
#include <map>
#include <stack>

using namespace std;

int main() 
{
	cin.tie(0);
    ios::sync_with_stdio(false);

	int n,t;
	vector <int> v;

	cin >> n;

	int a = 1;
	int b = n;
	if(b%2==1) b-=1;
	while(b > 0)
	{
		v.push_back(b);
		b-=2;
	}
	while(a <= n)
	{
		v.push_back(a);
		a += 2;
	}

	for(auto it : v)
	{
		cout << it << ' ';
	}
	cout << '\n';
    return 0;
}