10866번-덱

#include<bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	deque<int> q;
	int n;
	cin >> n;
	while (n--) {
		string s;
		cin >> s;
		if (s == "push_front") {
			int t;
			cin >> t;
			q.push_front(t);
		}
		else if (s == "push_back") {
			int k;
			cin >> k;
			q.push_back(k);
		}
		else if (s == "front") {
			if (q.empty()) {
				cout << -1 << "\n";
			}
			else cout << q.front() << "\n";
		}
		else if (s == "back") {
			if (q.empty()) {
				cout << -1 << "\n";
			}
			else cout << q.back() << "\n";
		}
		else if (s == "size")cout << q.size() << "\n";
		else if (s == "pop_front") {
			if (q.empty()) cout << -1 << "\n";
			else {
				cout << q.front() << "\n";
				q.pop_front();
			}
		}
		else if (s == "pop_back") {
			if (q.empty()) cout << -1 << "\n";
			else {
				cout << q.back() << "\n";
				q.pop_back();
			}
		}
		else {
			if (q.empty())cout << 1 << "\n";
			else cout << 0 << "\n";
		}
	}
}