#include <list> #include <iostream> #include <cstdio> #include <cctype> using namespace std; typedef long long ll; list < ll > l; inline ll read () { ll x=0,f=1; char ch=getchar(); while(!isdigit(ch)) { if(ch=='-') f=-1; ch=getchar(); } while(isdigit(ch)) { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return x*f; } int n; signed main() { n=read(); for(register int i=1; i<=n; i++) l.push_back(read()); for(list < ll >::iterator it=l.begin(); it!=l.end(); it++) cout<<*it<<' '; return 0; //l.sort(); 自带排序 //https://blog.csdn.net/zhouzhenhe2008/article/details/77428743/ }