#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
typedef long long LL;
using namespace std;
const int MOD = 1e9+7;
const int SIZE = 1e6+10;
vector<int>d[2160001];
void print(int x){
    printf("%02d:%02d:%02d\n",x/3600,x/60%60,x%60);
}
int f(LL x){
    x%=(12000*360);
    if(x<0)x+=12000*360;
    if(x>12000*180)x=(12000*360)-x;
    return x;
}
void build(){
    LL h=0;
    LL m=0;
    for(int i=0;i<12*60*60;i+=10){
        d[f(h-m)].PB(i);
        h+=1000;
        m+=12000;
    }
}
int main(){
    build();
    int x;
    while(RI(x)==1){
        REP(i,SZ(d[x]))print(d[x][i]);
    }
    return 0;
}