#include <iostream>

using namespace std;

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

void insert(int i);

Node * head = NULL;

int main(){

    insert(2);
    cout << head->data << endl;

    return 0;
}

void insert(int i){
    
    //insert new node into empty list
    if (head == NULL){
	head = new Node;
	head->data = i;
    }

    else {
	Node * temp = new Node;
	temp->next = head->next;
	head = temp;
    }

    return;
}