#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int a,b;
int h,m;
int main(){
    scanf("%d %d UTC%d.%d",&a, &b, &h, &m);
    if(h<0) m=-m;
    int minute = (a+h-9)*60+ m*6 + b;
    minute += 1440*2;
    minute %= 1440;
    printf("%02d:%02d\n", minute/60, minute%60);
    return 0;
}