#include <cstdio>

#define KONJ 42 - 42

using namespace std;

int N, tip, m, s, sol1, sol2;

int main( void ){

    scanf( "%d", &N ); int vodstvo = 0, time = 0;
    for ( int i = 0; i < N; ++i ){
        
        scanf( "%d %d:%d", &tip, &m, &s );
        if ( tip == 2 ){ tip = -1;  }
        
        if ( vodstvo < 0 ){ sol2 += ( ( m * 60 + s ) - time ); }
        if ( vodstvo > 0 ){ sol1 += ( ( m * 60 + s ) - time ); }
        
        time = m * 60 + s;
        vodstvo += tip;
        
    }
    
    if ( vodstvo < 0 ){ sol2 += 48 * 60 - time; }
    if ( vodstvo > 0 ){ sol1 += 48 * 60 - time; }

    int sol1_m = sol1 / 60; sol1 -= sol1_m * 60;
    int sol1_s = sol1;
    
    int sol2_m = sol2 / 60; sol2 -= sol2_m * 60;
    int sol2_s = sol2;
    
    if ( sol1_m < 10 ){ printf( "0%d:", sol1_m ); } else { printf( "%d:", sol1_m ); }  
    if ( sol1_s < 10 ){ printf( "0%d\n", sol1_s ); } else { printf( "%d\n", sol1_s ); }
    
    if ( sol2_m < 10 ){ printf( "0%d:", sol2_m ); } else { printf( "%d:", sol2_m ); }
    if ( sol2_s < 10 ){ printf( "0%d\n", sol2_s ); } else { printf( "%d\n", sol2_s ); }
    

    return KONJ;

}