D-Decoding

////////////////          PRANTA KUMER PANDIT            ///////////////
//                      Test Case Less Template                       ||
//                                                                    ||
//      BANGLADESH  UNIVERSITY OF BUSINESS AND TECHNOLOGY             ||
//                          INTAKE 52                                 ||
//                      DEPARTMENT OF CSE                             ||
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
//                      So, WELCOME TO ISHAN'S PERADISE           //
//                (-.-) Want to be a Secret tool of next ICPC  (-.-)  //
 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb   push_back
#define yes   cout<<"YES"<<endl
#define no   cout<<"NO"<<endl
#define all(x) (x).begin(), (x).end()
#define gcd(a,b)      __gcd(a,b)
#define lcm(a,b)  (a*b)/__gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve(){
int n;
    cin >> n;
    string s;
    cin >> s;
    deque<char> o;
    if (n % 2 == 1) {
        for (int i = 0; i < n; i++) {
            if (i % 2 == 0) o.push_back(s[i]);
            else o.push_front(s[i]);
        }
    } else {
        for (int i = 0; i < n; i++) {
            if (i % 2 == 0)
                o.push_front(s[i]);
            else
                o.push_back(s[i]);
        }
    }
    for (char c : o) cout << c; cout << '\n';
}
int32_t main() {
    optimize();
    solve();
}
 
//                                   THANKS                             //