#include <iostream>
using namespace std;
 
const int MAX_SIZE = 100;
const int BIGEST_NO = 1000;
 
int main() {
	int n, v[MAX_SIZE + 1];
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
	}
	for (int i = 1; i <= n; ++i) {
		int x  = v[i], neighbor = -1;
		int bigestNo = BIGEST_NO + 1;
		for (int j = 1; j <= n; ++j) {
			if (v[i] > x && v[i] < bigestNo) {
				bigestNo = v[i];
				neighbor = v[i];
			}
		}
		cout << neighbor << " ";
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY29uc3QgaW50IE1BWF9TSVpFID0gMTAwOwpjb25zdCBpbnQgQklHRVNUX05PID0gMTAwMDsKCmludCBtYWluKCkgewoJaW50IG4sIHZbTUFYX1NJWkUgKyAxXTsKCWNpbiA+PiBuOwoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSB7CgkJY2luID4+IHZbaV07Cgl9Cglmb3IgKGludCBpID0gMTsgaSA8PSBuOyArK2kpIHsKCQlpbnQgeCAgPSB2W2ldLCBuZWlnaGJvciA9IC0xOwoJCWludCBiaWdlc3RObyA9IEJJR0VTVF9OTyArIDE7CgkJZm9yIChpbnQgaiA9IDE7IGogPD0gbjsgKytqKSB7CgkJCWlmICh2W2ldID4geCAmJiB2W2ldIDwgYmlnZXN0Tm8pIHsKCQkJCWJpZ2VzdE5vID0gdltpXTsKCQkJCW5laWdoYm9yID0gdltpXTsKCQkJfQoJCX0KCQljb3V0IDw8IG5laWdoYm9yIDw8ICIgIjsKCX0KCXJldHVybiAwOwp9

MTAKMTUgNDcgNSAxMiAyMSA1IDY0IDg1IDY0IDEy

10
15 47 5 12 21 5 64 85 64 12