#include <stdio.h>
#include<stdlib.h>
 
typedef struct node
{
int data;
struct node *next;
}node;
 
void main()
{
node *head,*P;
int n,i;
 
printf("Enter no. of elements\n");
scanf("%d",&n);
 
printf("Enter %d data elements\n",n);
head=(node*)malloc(sizeof(node));
scanf("%d",&(head->data));
head->next = NULL;
P=head;
for(i=1;i<n;i++)
{
P->next=(node*)malloc(sizeof(node));
P=P->next;
P->next=NULL;
scanf("%d",&(P->data));
}
P = head;
while(P!=NULL)
{
printf("%d",P->data);
P=P->next;
}
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlPHN0ZGxpYi5oPgoKdHlwZWRlZiBzdHJ1Y3Qgbm9kZQp7CmludCBkYXRhOwpzdHJ1Y3Qgbm9kZSAqbmV4dDsKfW5vZGU7Cgp2b2lkIG1haW4oKQp7Cm5vZGUgKmhlYWQsKlA7CmludCBuLGk7CgpwcmludGYoIkVudGVyIG5vLiBvZiBlbGVtZW50c1xuIik7CnNjYW5mKCIlZCIsJm4pOwoKcHJpbnRmKCJFbnRlciAlZCBkYXRhIGVsZW1lbnRzXG4iLG4pOwpoZWFkPShub2RlKiltYWxsb2Moc2l6ZW9mKG5vZGUpKTsKc2NhbmYoIiVkIiwmKGhlYWQtPmRhdGEpKTsKaGVhZC0+bmV4dCA9IE5VTEw7ClA9aGVhZDsKZm9yKGk9MTtpPG47aSsrKQp7ClAtPm5leHQ9KG5vZGUqKW1hbGxvYyhzaXplb2Yobm9kZSkpOwpQPVAtPm5leHQ7ClAtPm5leHQ9TlVMTDsKc2NhbmYoIiVkIiwmKFAtPmRhdGEpKTsKfQpQID0gaGVhZDsKd2hpbGUoUCE9TlVMTCkKewpwcmludGYoIiVkIixQLT5kYXRhKTsKUD1QLT5uZXh0Owp9Cn0=

NQoxCjIKNAo1CjY=

5
1
2
4
5
6