#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 1000000007;
const double pi = acos(-1.0);
inline void gn(long long& x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int& x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long& x) {
  long long t;
  gn(t);
  x = t;
}
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long x, long long mod) {
  long long t = 1ll;
  while (x) {
    if (x & 1) t = t * a % mod;
    a = a * a % mod;
    x >>= 1;
  }
  return t;
}
const int maxn = 33;
pair<int, int> p[maxn];
int ans[maxn];
int main() {
  int n;
  gn(n);
  for (int i = (0); i <= (n - 1); i++) {
    gn(p[i].first);
    p[i].second = i;
  }
  sort(p, p + n);
  for (int i = (0); i <= (n - 1); i++) ans[p[(i + 1) % n].second] = p[i].first;
  for (int i = (0); i <= (n - 1); i++)
    printf("%d%c", ans[i], (i == n - 1)[" \n"]);
  return 0;
}
