#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod  998244353

ll quan(int x, int y) {
	ll ans = 1;
	for (int i = x; i <= y; i++) {
		ans = (ans * i) % mod;
	}
	return ans % mod;
}
ll cnt[10000001];

ll quan1(int x, int y) {
	ll ans = 1;
	for (int i = x; i <= y; i++) {
		ans = (ans * i) % mod;
		cnt[i] = ans;
	}
	return ans % mod;
}

long long PowMod(long long a, int b) {
	long long ret = 1;
	while (b) {
		if (b & 1)
			ret = ret * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ret % mod;
}
ll inv[10000001];

ll in(ll n) {
	inv[1] = 1;
	for (int i = 2; i <= n; i++)
		inv[i] = (long)mod - (mod / i) * inv[mod % i] % mod;
}

int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cout << i << " ";
	}


}