#include <iostream>

using namespace std;

struct Node
{
    int minutes;
    int hours;

    Node* next;
};

Node* create_node(int hours, int minutes)
{
    Node* n = (Node*)malloc(sizeof(Node));
    n->minutes = minutes;
    n->hours = hours;
    return n;
}

void delete_node(Node* node)
{
    free(node);
}

int main()
{
    int n;
    printf("Enter list length: ");
    scanf("%d", &n);

    int minutes, hours;
    printf("Enter time: ");
    scanf("%d:%d", &hours, &minutes);

    Node* head = create_node(hours, minutes);

    for (int i = 1; i < n; ++i)
    {
        int minutes, hours;
        printf("Enter time: ");
        scanf("%d:%d", &hours, &minutes);

        Node *p = head;
        while (p)
        {
            if (p->hours < hours || (p->hours == hours && p->minutes <= minutes))
                break;

            if (p->next == NULL)
                break;

            p = p->next;
        }

        Node *t = p->next;
        p->next = create_node(hours, minutes);
        p->next->next = t;
    }

    Node *p;
    while (head)
    {
        p = head->next;
        delete_node(head);
        head = p;
    }

    return 0;
}