#include <iostream>
#include <cstdlib>
#include <stack>   //for class stack
#include <queue>   //for class queue
using namespace std;

int main()
{
	cout << "stack:\n";
	stack<int> s;   //born empty, but can hold ints
			//
	s.push(10);
	s.push(20);
	s.push(30);

	cout << s.top() << "\n";   //most recently pushed value
	s.pop();                   //Remove the value from the stack.

	cout << s.top() << "\n";
	s.pop();

	cout << s.top() << "\n\n";
	s.pop();

	cout << "queue:\n";
	queue<int> q;   //born empty, but can hold ints

	q.push(10);
	q.push(20);
	q.push(30);

	cout << q.front() << "\n"; //least recently pushed value
	q.pop();                   //Remove the value from the queue.

	cout << q.front() << "\n";
	q.pop();

	cout << q.front() << "\n";
	q.pop();

	return EXIT_SUCCESS;
}