#include<iostream>
#include<deque>
#include<algorithm>
#include<iterator>
using namespace std;
int main()
{
deque<int> intdep;
ostream_iterator<int> screan(cout," ");
intdep.push_back(13);
intdep.push_back(75);
intdep.push_back(28);
intdep.push_back(36);
cout<<"int dep:"<<endl;
sort(intdep.begin(),intdep.end());
copy(intdep.begin(),intdep.end(),screan);
cout<<endl;
intdep.push_front(0);
intdep.push_back(100);
cout<<"after adding two more elements"<<endl;
copy(intdep.begin(),intdep.end(),screan);
cout<<endl;
intdep.pop_front();
intdep.pop_front();
cout<<"after removing the first two element"<<endl;
copy(intdep.begin(),intdep.end(),screan);
cout<<endl;
intdep.pop_back();
intdep.pop_back();
cout<<"after removing the last two elements"<<endl;
copy(intdep.begin(),intdep.end(),screan);
cout<<endl;
return 0;
}