//#include<bits/stdc++.h> using namespace std; typedef long long ll; ll n; queue dhf; int main() { cin>>n; for(ll i=1;i<=n;i++){ ll in; cin>>in; dhf.push(in); } for(ll i=1;i<=n;i++){ cout<<"que size="<<dhf.size()<<"\n"; cout<<" que.front="<<dhf.front()<<endl; dhf.pop(); } return 0; };