#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = static_cast<ll>(1e9) + 7;
const int MAXN = static_cast<int>(1e6) + 17;
int n;
int a[MAXN], b[MAXN];
bool read() {
  if (!(cin >> n)) return false;
  for (ll i = 0; i < (ll)(n); ++i) cin >> a[i];
  return true;
}
void solve() {
  vector<int> id;
  for (ll i = 0; i < (ll)(n); ++i) id.emplace_back(i);
  sort(id.begin(), id.end(), [](int i, int j) { return a[i] < a[j]; });
  for (ll i = 0; i < (ll)(n); ++i) b[(i + 1) % n] = a[id[i]];
  for (ll i = 0; i < (ll)(n); ++i) a[id[i]] = b[i];
  for (ll i = 0; i < (ll)(n); ++i) cout << a[i] << ' ';
  cout << '\n';
}
int main() {
  cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  std::mt19937 rand('S' + 'E' + 'R' + 'E' + 'Z' + 'H' + 'K' + 'A');
  while (read()) solve();
  return 0;
};
