#include <bits/stdc++.h>
using namespace std;
long long n;
int main(){
    cin >> n;
    vector<long long> a(n);
    vector<vector<long long>> dp(n, vector<long long>(n , 0));
    for (long long i = 0; i < n; ++i){
        cin >> a[i];
        dp[i][i] = 1;
    }
    for (long long cl = 2; cl <= n; ++cl)
    {
        for (long long i = 0; i < n - cl + 1; ++i)
        {
            long long j = i + cl - 1;
            if (a[i] == a[j] and cl == 2)
            {
                dp[i][j] = 2;
            }
            else if (a[i] == a[j])
            {
                dp[i][j] = dp[i + 1][j - 1] + 2;
            }
            else 
            {
                dp[i][j] = max(dp[i + 1][j], dp[i][j - 1]);
            }
        }
    }
    long long i = 0, j = n - 1;
    vector<int> r;
    while (i <= j)
    {
        if (a[i] == a[j])
        {
            r . push_back(a[i]);
            ++i;
            --j;
        }
        else if (dp[i + 1][j] > dp[i][j - 1])
        {
            i++;
        }
        else {
            j--;
        }
    }
    //long long r = r . size();
    for (long long k = r . size() - 1 - (dp[0][n-1] % 2 == 0 ? 0 : 1); k >= 0; --k) {
        r.push_back(r[k]);
    }
    string s;
    for (long long c: r)
    {
        s += to_string(c) + " ";
    }
    cout << s;
}