#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
 
struct node{
		int x;
		struct node *next;
	};
 
int i,num;
 
int main() {
	struct node *tail;
	struct node *temp;
	struct node *counter;
	struct node *conductor;
	printf("How much data do you have to enter? ");
	scanf("%d",&num);
 
 
 
	tail = malloc(sizeof(struct node));
	counter = tail;
 
		printf("Enter data ");
		scanf("%d",&tail->x);
		counter->next=NULL;
	while ( i < num-1 ) {
		temp = malloc(sizeof(struct node));
		printf ("Enter data ");
		scanf ("%d",&temp->x);
		temp->next = NULL;
		counter->next = temp;
		counter = temp;
		i++;
	}; 
 
	conductor=tail;
	while ( conductor != NULL ) {
		printf("%d\n",conductor->x);
		conductor=conductor->next;
	}
 
	return 0;
}