#include <iostream>
#include <algorithm>
#include <random>
#include <numeric>
#include <vector>
#include <chrono>
#include "integer.h"

std::vector<int> findPermutation(int n) {
	int lst, now, i, j, cnt(0);
	std::vector<signed char> done(n, 0);
	std::vector<int> a(n),p(n);
	std::mt19937 eng(std::chrono::system_clock::now().time_since_epoch().count());
	for (i = 0; i < n; ++i) {
		operate(i);
	}
	lst = n;
	std::iota(a.begin(), a.end(), 1);
	while (cnt < n) {
		std::shuffle(a.begin(), a.end(), eng);
		for (i = 0; i < n; ++i) {
			if (!done[a[i]]) {
				now = operate(a[i]);
				if (now != lst + 1) {
					++cnt;
					p[a[i]] = n - lst + now;
					done[a[i]] = 1;
				}
				lst = now;
			}
		}
	}
	return p;
}