#include <bits/stdc++.h>
using namespace std;
struct Node{
int data;
Node* next;
Node(int val):next(nullptr),data(val){};
};
Node* ll(vector<int>&a){
if(a.size()==0)return nullptr;
Node* head = new Node(a[0]);
Node* curr = head;
for(int i = 1;i<a.size();i++){
curr->next = new Node(a[i]);
curr = curr->next;
}
return head;
}
void print(Node* head){
if(head == nullptr)return;
Node* curr = head;
while(curr!=NULL){
cout<<curr->data<<endl;
curr = curr->next;
}
}
int main() {
int n;
cin>>n;
vector<int>a(n);
for(int i = 0;i<n ;i++){
cin>>a[i];
}
Node*head = ll(a);
print(head);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgpzdHJ1Y3QgTm9kZXsKCWludCBkYXRhOwoJTm9kZSogbmV4dDsKCU5vZGUoaW50IHZhbCk6bmV4dChudWxscHRyKSxkYXRhKHZhbCl7fTsKfTsKCk5vZGUqIGxsKHZlY3RvcjxpbnQ+JmEpewoJaWYoYS5zaXplKCk9PTApcmV0dXJuIG51bGxwdHI7CglOb2RlKiBoZWFkID0gbmV3IE5vZGUoYVswXSk7CglOb2RlKiBjdXJyID0gaGVhZDsKCQogICBmb3IoaW50IGkgPSAxO2k8YS5zaXplKCk7aSsrKXsKICAgCWN1cnItPm5leHQgPSBuZXcgTm9kZShhW2ldKTsKICAgCWN1cnIgPSBjdXJyLT5uZXh0OwogICB9CiAgIHJldHVybiBoZWFkOwp9CnZvaWQgcHJpbnQoTm9kZSogaGVhZCl7CiAgaWYoaGVhZCA9PSBudWxscHRyKXJldHVybjsKICBOb2RlKiBjdXJyID0gaGVhZDsKCXdoaWxlKGN1cnIhPU5VTEwpewoJCWNvdXQ8PGN1cnItPmRhdGE8PGVuZGw7CgkJY3VyciA9IGN1cnItPm5leHQ7Cgl9Cn0KaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbj4+bjsKCQl2ZWN0b3I8aW50PmEobik7CgkJZm9yKGludCBpID0gMDtpPG4gO2krKyl7CgkJCWNpbj4+YVtpXTsKCQl9CglOb2RlKmhlYWQgPSBsbChhKTsKCXByaW50KGhlYWQpOwoKCXJldHVybiAwOwp9