8 (List)!!! (1 балл)

#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <map>
#include <list>
#include <deque>
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define pi (3.14159265358979323846264338327950288419716939937510)
#define unique(v) v.resize(unique(all(v)) - v.begin())
#define bipbup ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;

int main()
{
    int n;
    cin >> n;
    int a[10000];
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    deque <int> d;
    for (int i = n - 1; i >= 0; --i)
    {
        d.pb(a[i]);
        d.push_front(a[i]);
    }
    for (int i = 0; i < 2 * n; ++i)
        cout << d[i] << ' ';
    re 0;
}