#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
typedef pair<int, int> PII;
#define fr(i, a, n) for(int i = a; i <= n; i ++)
#define rf(i, a, n) for(int i = n; i >= a; i --)

const int N = 3e5 + 10;
const int mod = 998244353;
int T, t, n, m, a, b, idx, flag, a1, b1, a2, b2, k, x, y, mx, mn;
int r, mid, c, mi, d, l;
int ans, sum, cnt;
int q[N], p[N], dp[N][15], h[N], mp[N], f[N];
char path[5][N], st[5][N];
string s, ss, s1, s2;

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

struct node1
{
	int a, b;
}str[N];

struct node
{
	int l, r, sum, ans;
}tr[N * 4];

int cmp(node1 x, node1 y)
{
	return x.b > y.b;
}

void solve()
{
	cin >> n;
	fr(i, 1, n)
	{
		cout << i << ' ';
	}
	cout << endl;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
//	cin >> T;
//	while(T -- )
		solve();
	return 0;
}