#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

const int LIMIT = CLOCKS_PER_SEC / 4.1;

int n;
VI a;

int main()
{
	clock_t start = clock();

	cin >> n;
	a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];

	while (1)
	{
		next_permutation(a.BG + 1, a.EN);
		bool ok = true;
		FOR(i, 1, n - 2)
		{
			FOR(j, i + 1, n - 1)
			{
				if (a[i] > a[j])
					FOR(k, j + 1, n)
						if (a[j] < a[k] && a[i] > a[k])
						{
							ok = false;
							break;
						}
			}
		}
		if (ok) break;
		if (clock() - start > LIMIT) 
		{
			cout << -1;
			return 0;
		}
	}

	FOR(i, 1, n) cout << a[i] << " ";

	return 0;
}