class Deque{
	struct Element{
		Element* prev;
		Element* next;
		T* data;
	};
	Element* beg;
	Element* end;
public:
	bool add_first(T data){
		Element* temp = new Element;
		temp->prev = nullptr;
		temp->next = beg;
		beg = temp;
	}
	bool add_last(T data){
		Element* temp = new Element;
		temp->prev = end;
		temp->next = nullptr;
		end = temp;
	}
	T pop_first(){
		temp = beg;
		beg = temp->next;

	}
	T pop_last(){

	}
	T look_first(){

	}
	T look_last(){

	}
};