#include <iostream>
using namespace std;
struct Node
{
int data;
struct Node *next;
};
int main()
{
Node *L = { NULL };
int n;
cin >> n;
L->next = NULL;
for (int i = 0; i < n; i++)
{
Node *p = { NULL };
cin >> p->data;
p->next = L->next;
L->next = p;
}
int i = 5, e = 10;
Node *q = { NULL }, *p;
q->data = e;
p = L;
int j = 0;
while (p&&j<i - 1)
{
p = p->next;
j++;
}
q->next = p->next;
p->next = q;
n++;
Node *P;
P = L;
for (int i = 0; i < n; i++)
{
P = P->next;
if (P->next == NULL)
break;
cout << P->data;
}
return 0;
}
using namespace std;
struct Node
{
int data;
struct Node *next;
};
int main()
{
Node *L = { NULL };
int n;
cin >> n;
L->next = NULL;
for (int i = 0; i < n; i++)
{
Node *p = { NULL };
cin >> p->data;
p->next = L->next;
L->next = p;
}
int i = 5, e = 10;
Node *q = { NULL }, *p;
q->data = e;
p = L;
int j = 0;
while (p&&j<i - 1)
{
p = p->next;
j++;
}
q->next = p->next;
p->next = q;
n++;
Node *P;
P = L;
for (int i = 0; i < n; i++)
{
P = P->next;
if (P->next == NULL)
break;
cout << P->data;
}
return 0;
}