cSorted sequentially with language dynamic memory allocation

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct student {
        int id;
        char name[20];
    int score[4];
        struct student *next;
};

int main()
{

        int count = 0, id,sc[4];
        char name[20],line[200];
        struct student *p, *head, *node = NULL;
        printf("Please enter your school name and name"\n");
        fgets(line, 200, stdin);
        while (fgets(line, 200, stdin) != NULL) {
            sscanf(line, "%d %s %d %d %d %d", &id, name,
               &sc[0],&sc[1],&sc[2],&sc[3]);
                p = (struct student *) malloc(sizeof(struct student));
                node = (struct student *) malloc(sizeof(struct student));
                if (head == NULL)
                        head = p;
                else
                        node->next = p;
                node = p;
                if (p == NULL) {
                        perror("malloc");
                        exit(1);
                }
                p->id = id;
                strcpy(p->name, name);
                node=p->next;
        for(int i=0; i< 4; i++)
           p->score[i]=sc[i];
        }

        printf("\n* Student Information *\n");
        p = head;
        while (p != NULL) {
                count++;
                printf("Grade: %d Name: %s: ", p->id, p->name);
        for(int i=0; i< 4; i++)
           printf("%6d", p->score[i]);
        printf("\n");
                p = p->next;
        }

        printf ("Total %d people".\n", count);
        exit(0);
}