#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
inline bool mina(A &first, B second) {
  return (first > second) ? (first = second, 1) : 0;
}
template <class A, class B>
inline bool maxa(A &first, B second) {
  return (first < second) ? (first = second, 1) : 0;
}
const int MAXN = 25;
int in[MAXN];
int sorted_in[MAXN];
map<int, int> pos;
int ans[MAXN];
int main() {
  int N;
  cin >> N;
  for (int i = 0; (i) < (N); ++(i)) {
    cin >> in[i];
    sorted_in[i] = in[i];
    pos[in[i]] = i;
  }
  sort(sorted_in, sorted_in + N);
  for (int i = 0; (i) < (N); ++(i)) {
    int now = sorted_in[i];
    int nxt = sorted_in[(i + 1) % N];
    ans[pos[nxt]] = now;
  }
  for (int mask = 0; (mask) < (1 << N); ++(mask)) {
    int sum1 = 0;
    int sum2 = 0;
    if (mask == 0 || mask == (1 << N) - 1) continue;
    for (int i = 0; (i) < (N); ++(i)) {
      if (mask & (1 << i)) {
        sum1 += in[i];
        sum2 += ans[i];
      }
    }
    if (sum1 == sum2) {
      printf("-1\n");
      return 0;
    }
  }
  for (int i = 0; (i) < (N); ++(i)) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are different, i. e. 

<image>

Input

The first line contains one integer n (1 ≤ n ≤ 22) — the size of the array.

The second line contains n space-separated distinct integers a1, a2, ..., an (0 ≤ ai ≤ 109) — the elements of the array.

Output

If there is no such array b, print -1.

Otherwise in the only line print n space-separated integers b1, b2, ..., bn. Note that b must be a permutation of a.

If there are multiple answers, print any of them.

Examples

Input

2
1 2


Output

2 1 


Input

4
1000 100 10 1


Output

100 1 1000 10

Note

An array x is a permutation of y, if we can shuffle elements of y such that it will coincide with x.

Note that the empty subset and the subset containing all indices are not counted.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
inline bool mina(A &first, B second) {
  return (first > second) ? (first = second, 1) : 0;
}
template <class A, class B>
inline bool maxa(A &first, B second) {
  return (first < second) ? (first = second, 1) : 0;
}
const int MAXN = 25;
int in[MAXN];
int sorted_in[MAXN];
map<int, int> pos;
int ans[MAXN];
int main() {
  int N;
  cin >> N;
  for (int i = 0; (i) < (N); ++(i)) {
    cin >> in[i];
    sorted_in[i] = in[i];
    pos[in[i]] = i;
  }
  sort(sorted_in, sorted_in + N);
  for (int i = 0; (i) < (N); ++(i)) {
    int now = sorted_in[i];
    int nxt = sorted_in[(i + 1) % N];
    ans[pos[nxt]] = now;
  }
  for (int mask = 0; (mask) < (1 << N); ++(mask)) {
    int sum1 = 0;
    int sum2 = 0;
    if (mask == 0 || mask == (1 << N) - 1) continue;
    for (int i = 0; (i) < (N); ++(i)) {
      if (mask & (1 << i)) {
        sum1 += in[i];
        sum2 += ans[i];
      }
    }
    if (sum1 == sum2) {
      printf("-1\n");
      return 0;
    }
  }
  for (int i = 0; (i) < (N); ++(i)) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}

```