#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;
}