For given an integer $n$, print all permutations of $\\{1, 2, ..., n\\}$ in lexicographic order.

Constraints

* $1 \leq n \leq 9$

Input

An integer $n$ is given in a line.

Output

Print each permutation in a line in order. Separate adjacency elements by a space character.

Examples

Input

2


Output

1 2
2 1


Input

3


Output

1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repd(i,a,b) for (int i = (a); i < (b); i++)
typedef long long ll;

void print(const vector<int> v)
{
	rep(i, v.size())
	{
		if (i) cout << " ";
		cout << v[i];
	}
	cout << endl;
}

int main(void)
{
	int n;
	cin >> n;
	vector<int> v;
	repd(i, 1, n+1)
	{
		v.push_back(i);
	}
	
    do {
        print(v);
    } while (std::next_permutation(v.begin(), v.end()));
}
