#include<stdio.h>
#include<conio.h>
#include<alloc.h>
struct node { int info; struct node *next; } *p,*q,*head;
void insert(int,int);
int create();
/*To create a linked list*/
void main()
{ clrscr();
printf("The elements entered are:");
printf("%d", create());
getch();
}

int create()
{
 int i,n,x;   head=NULL;
 printf("\nHow many elements to be entered");
 scanf("%d", &n);
 printf("Enter the elements\n");
 for(i=1;i<=n;i++)
 {
  scanf("%d", &x);
  insert(x,i);
  return(x);
 }
}
void insert(int x,int j)
{
 int i;
 q=(struct node *)malloc(sizeof(struct node));
 q->info=x;
 if(j==1)  { q->next=head; head=q; }
 else
 {
  p=head;
  for(i=1;i<j-1;i++)
  p=p->next;
  q->next=p->next;
  p->next=q;
 }
}