#include <iostream>
using namespace std;
#define ok 0
#define error -1
class SeqList {
private:
int* list;
int maxsize;
int size;
public:
SeqList();
~SeqList();
void get_list(int n,int index) {
list[index] = n;
size++;
}
int list_size() { return size; }
void list_insert(int i, int item) {
for (int k = 0; k < size - i + 1; k++) {
list[size - k] = list[size-k-1];
}
list[i] = item;
size++;
}
int list_del(int i) {
if (i <= size) {
for (int k = 0; k < size - i; k++) {
list[i + k] = list[i + 1 + k];
}
size--;
return 1;
}
else {
return 0;
}
}
int list_get(int i) {
if (i - 1 < 0 || i >= size) {
return error;
}
else {
return list[i - 1];
}
}
void list_display() {
for (int k = 0; k < size; k++) {
cout << list[k] << " ";
}
cout << endl;
}
};
SeqList::SeqList() {
maxsize = 1000;
size = 0;
list = new int[maxsize];
}
SeqList::~SeqList() {
delete[]list;
}
int main()
{
SeqList ex;
int n;
cin >> n;
int k = 0;
while (n--) {
int num=0;
cin >> num;
ex.get_list(num,k );
k++;
}
cout << ex.list_size() << " ";
ex.list_display();
int ii,in;
cin >> ii >> in;
ex.list_insert(ii-1, in);
cout << ex.list_size() << " ";
ex.list_display();
int ii1, in1;
cin >> ii1 >> in1;
ex.list_insert(ii1 - 1, in1);
cout << ex.list_size() << " ";
ex.list_display();
int d_i;
cin >> d_i;
if (ex.list_del(d_i - 1) == 1) {
cout << ex.list_size() << " ";
ex.list_display();
}
else {
cout << "error" << endl;
}
int d_i1;
cin >> d_i1;
if (ex.list_del(d_i1 - 1) == 1) {
cout << ex.list_size() << " ";
ex.list_display();
}
else {
cout << "error" << endl;
}
int nn;
cin >> nn;
(ex.list_get(nn) < 0) ? cout << "error" : cout << ex.list_get(nn);
cout << endl;
int nn1;
cin >> nn1;
(ex.list_get(nn1) < 0) ? cout << "error" : cout << ex.list_get(nn1);
cout << endl;
}