#include <iostream>
#include <string>
using namespace std;

struct Stack {
	int A[100];
	int k = 0;
	
	void push(int n) {
		A[k] = n;
		k = k + 1;
	}
	
	int pop() {
		k = k - 1;
		return A[k];
	}
	
	int back() const {
		return A[k - 1];
	}
	
	int size() const {
		return k;
	}
	
	void clear() {
		k = 0;
	}
};

int main() {
	Stack st;
	
	string s;
	cin >> s;
	
	while (s != "exit") {
		
		if (s == "push") {
			int n;
			cin >> n;
			st.push(n);
			cout << "ok\n";
		} else if (s == "pop") {
			cout << st.pop() << '\n';
		} else if (s == "back") {
			cout << st.back() << '\n';
		} else if (s == "size") {
			cout << st.size() << '\n';
		} else if (s == "clear") {
			st.clear();
			cout << "ok\n";
		}
		
		cin >> s;
	}
	
	cout << "bye\n";
	
	return 0;
}