#include<bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i=0;i<(int)n;i++)
#define FOB(i,n) for(int i=n;i>=1;i--)
#define SIZE(t) ((int)((t).size()))
const int INFINITY32 = 1073741823;
const long long INFINITY64 = 4611686018427387903LL;
#ifdef EBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define DEBUG(var) DBG { cout << #var << ": " << (var) << endl; }
typedef complex<long double> point;
bool ccw(point p, point a, point b) { if ((conj(a - p) * (b - p)).imag() <= 0) return false; else return true; }
template <class T, class U> ostream& operator<<(ostream& out, const pair<T, U> &par) { out << "[" << par.first << ";" << par.second << "]"; return out; }
template <class T> ostream& operator<<(ostream& out, const vector<T> &cont) { out << "("; for (const auto &x:cont) out << x << ", "; out << ")"; return out; }
template <class T> ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for (const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U> ostream& operator<<(ostream& out, const map<T,U> &cont) { out << "{"; for (const auto &x:cont) out << x << ", "; out << "}"; return out; }
int main() {
map<string,int> vek = { {"fero",17}, {"zuza",23}, {"emo",20} };
cerr << vek << endl;
DEBUG(vek);
queue< pair<int,int> > Q;
Q.push( {47,42} );
while (!Q.empty()) {
auto rec = Q.front(); Q.pop();
cout << rec << endl;
}
}