struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(NULL) {}
};

#include <iostream>
#pragma once
#include <iostream>
using namespace std;


struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(NULL) {}
};
ListNode* SolveB(int n) {
    /* your code starts here */
    //construct a list accrording to input
    int value;
    cin >> value;
    ListNode* head = new ListNode(0);
    head->val = value;
    ListNode* temp = new ListNode(0);
    head->next = temp;


    for (int i = 1; i < n; i++) {
        if (i <= n - 2) {
            cin >> value;
            temp->val = value;
            
            ListNode* p =new ListNode(0);
            temp->next = p;
            temp = p;
        }
        else {
            cin >> value;
            temp->val = value;
            temp->next = NULL;
        }
    }

ListNode* odd = head;
ListNode* even = head->next;
ListNode* evenhead = even;

if(odd!=NULL){
while((even!=NULL)&&(even->next!=NULL)){
odd->next = odd->next->next;
even->next = even->next->next;
odd = odd->next;
even = even->next;
}
odd->next = evenhead;
}
return head;
    
}

int main() {
    int n;
    cin >> n;
    // get the head node of rearranged list
    ListNode* ls = SolveB(n);
    
    for (int i = 0; i < n; i++) {
        cout << ls->val << " ";
        ls = ls->next;
    }
    system("pause");
    return 0;
}