#include <bits/stdc++.h>
using namespace std;
int main() {
deque< int > a;
vector < int > v;
v.push_back(1);
v.push_back(2);
a.push_back(2);
a.push_front(1);
for(int i = 0;i<a.size();i++)
{
cout << a[i] << endl;
}
vector<int> :: iterator k = find(v.begin(),v.end(),0);
cout << *k << endl;
// your code goes here
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWRlcXVlPCBpbnQgPiBhOwoJdmVjdG9yIDwgaW50ID4gdjsKCXYucHVzaF9iYWNrKDEpOwoJdi5wdXNoX2JhY2soMik7CgoJCglhLnB1c2hfYmFjaygyKTsKCWEucHVzaF9mcm9udCgxKTsKCQoJZm9yKGludCBpID0gMDtpPGEuc2l6ZSgpO2krKykKCXsKCQljb3V0IDw8IGFbaV0gPDwgZW5kbDsKCQoJfQoJdmVjdG9yPGludD4gOjogaXRlcmF0b3IgayA9IGZpbmQodi5iZWdpbigpLHYuZW5kKCksMCk7CgkKCWNvdXQgPDwgKmsgPDwgZW5kbDsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXJldHVybiAwOwp9