#include <iostream>
#include <algorithm>
using namespace std;
 
typedef long long ll;
const int max_n = 23;
 
pair<int, int> a[max_n];
int b[max_n];
 
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	int n;
 
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i].first, a[i].second = i;
	sort(a, a + n);
	for (int i = 0; i < n; i++)
		b[a[i].second] = a[(i+1)%n].first;
 
	for (int i = 0; i < n; i++)
		cout << b[i] << " ";
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdHlwZWRlZiBsb25nIGxvbmcgbGw7CmNvbnN0IGludCBtYXhfbiA9IDIzOwoKcGFpcjxpbnQsIGludD4gYVttYXhfbl07CmludCBiW21heF9uXTsKCnNpZ25lZCBtYWluKCkKewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CgljaW4udGllKDApOwoJCglpbnQgbjsKCQoJY2luID4+IG47Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKCQljaW4gPj4gYVtpXS5maXJzdCwgYVtpXS5zZWNvbmQgPSBpOwoJc29ydChhLCBhICsgbik7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKCQliW2FbaV0uc2Vjb25kXSA9IGFbKGkrMSklbl0uZmlyc3Q7CgkKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQoJCWNvdXQgPDwgYltpXSA8PCAiICI7CgkKCXJldHVybiAwOwp9

MgoxIDI=

2
1 2