h, m = [int(i) for i in input().split(':')]
h1 = int(h)
m1 = int(m)
m1 += 1
if m1 == 60:
m1 = 0
h1 += 1
if h1 == 24:
h1 = 0
if m1 == 0:
m = '00'
elif m1 < 10:
m = '0' + str(m1)
else:
m = str(m1)
if h1 == 0:
h = '00'
elif h1 < 10:
h = '0' + str(h1)
else:
h = str(h1)
while h != m[::-1]:
m1 += 1
if m1 == 60:
m1 = 0
h1 += 1
if h1 == 24:
h1 = 0
if m1 == 0:
m = '00'
elif m1 < 10:
m = '0' + str(m1)
else:
m = str(m1)
if h1 == 0:
h = '00'
elif h1 < 10:
h = '0' + str(h1)
else:
h = str(h1)
print(h + ':' + m)#include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
bool check(int h, int m){
string hh = to_string(h);
string mm = to_string(m);
if(hh.size() < 2)hh = "0" + hh;
if(mm.size() < 2)mm = "0" + mm;
reverse(mm.begin(), mm.end());
if(hh == mm)return 1;
return 0;
}
string mk(int a){
string s = to_string(a);
if(s.size() < 2)s = "0" + s;
return s;
}
int main() {
FastIO;
string s;
cin >> s;
string hh = s.substr(0, 2), mm = s.substr(3, 2);
int h = stoi(hh), m = stoi(mm);
while(1){
m++;
if(m == 60){
m = 0;
h++;
}
if(h == 24){
h = 0;
}
if(check(h, m))break;
}
cout << mk(h) << ":" << mk(m) << '\n';
return 0;
}
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |
124. Binary Tree Maximum Path Sum | 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
501A - Contest | 160A- Twins |
752. Open the Lock | 1535A - Fair Playoff |
1538F - Interesting Function | 1920. Build Array from Permutation |
494. Target Sum | 797. All Paths From Source to Target |
1547B - Alphabetical Strings | 1550A - Find The Array |
118B - Present from Lena | 27A - Next Test |
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |