#include <iostream>

class linked_list{
	
	struct node{
		int data;
		node *next;
		
		node(int data) : data(data) {
			next=0;
		}	
		
		~node(){
			if(next!=0){
				delete next;
			}
		}
	};
	
	node *head;
	
public :	
	
	linked_list() : head(0) {
	}
	
	~linked_list(){
		delete head;
	}
	
	void insert(int data){
		if(head==0){
			head=new node(data);
		}else{
			node *p=head;
			while(p->next!=0){
				p=p->next;
			}
			p->next=new node(data);
		}
	}
		
	int get_element_from_rear(int rank){
		node *p=head, *q=head;
		while(rank--){
			q=q->next;
		}
		while(q!=0){
			p=p->next;
			q=q->next;
		}
		return p->data;
	}
};

int main(int argc, char *argv[]){
	int a[]={5, 2, 3, 6, 9, 7, 1, 8, 9, 22};
	linked_list y;
	for(int i=0; i<sizeof(a)/sizeof(int); i++){
		y.insert(a[i]);
	}
	std::cout<<y.get_element_from_rear(7)<<std::endl;
}

/* Sample Run :
rahul@kodersbox:~/Desktop$ g++ linked_list.cpp -o linked_list
rahul@kodersbox:~/Desktop$ ./linked_list
6
*/