#include <iostream>
using namespace std;

struct node {
	node * next;
	int data;
};

void push(node * List, int x) {
	node * temp = new node;

	temp->next = NULL;
	temp->data = x;

	node * tempList = List;
	while (1) {
		if (tempList->next == NULL) break;
		tempList = tempList->next;
	}

	tempList->next = temp;
}

void pop(node * List) {

	node * tempList = List;
	while (1) {
		node * tempNode = tempList->next;
		if (tempNode->next == NULL) break;
		tempList = tempList->next;
	}

	tempList->next = NULL;
}

int main () {

	node * List = new node;
	List->next = NULL;
	List->data = 2;
	push(List, 3);
	push(List, -1);
	pop(List);

	///node * tempNode = List->next;
	//cout << tempNode->data << endl;

	node * temp = List;
	while (1) {
		cout << temp->data << endl;

		if (temp->next == NULL) break;
		temp = temp->next;
	}

	return 0;
}