# print('UAGCCGAU')
# n = int(input())
# d = list(input())
# for i in range(n):
# if d[i] == 'A':
# d[i] = 'U'
# elif d[i] == 'T':
# d[i] = 'A'
# elif d[i] == 'C':
# d[i] = 'G'
# else:
# d[i] = 'C'
#
# for i in range(n):
# print(d[i], end='')
# d = int(input())
# p = 0
# for i in range(12):
# for j in range(60):
# if i 30 + (1 / 2) j - 6 j == d or 6 j - i 30 - (1 / 2) j == d:
# p = p + 1
# elif i 30 + (1 / 2) j - 6 j == 360 - d or 6 j - i 30 - (1 / 2) j == 360 - d:
# p = p + 1
# print(p)
# for i in range(12):
# for j in range(60):
# if i 30 + (1 / 2) j - 6 j == d or 6 j - i 30 - (1 / 2) j == d:
# print("%02d" % i, ':', "%02d" % j, sep='')
# p = p - 1
# if p == -1:
# break
# elif i 30 + (1 / 2) j - 6 j == 360 - d or 6 j - i 30 - (1 / 2) j == 360 - d:
# print("%02d" % i, ':', "%02d" % j, sep='')
# p = p - 1
# if p == -1:
# break
# print('49')
# def f(a, b):
# global d
# return d[a][b] + d[a + 1][b] + d[a][b + 1] + d[a + 1][b + 1]
#
#
# n = int(input())
# d = []
# for i in range(n):
# v = list(map(int, input().split()))
# d.append(v)
# max = 0
# for i in range(n - 1):
# for j in range(n - 1):
# if max < f(i, j):
# max = f(i, j)
# print(max)
# import sys
# limit_number = 2000000000
# sys.setrecursionlimit(limit_number)
#
#
# def f(a, b):
# global d, m
# k = 0
# for i in range(m):
# for j in range(m):
# k = k + d[a + i][b + j]
# return k
#
# n, m = map(int, input().split())
# d = []
# for i in range(n):
# v = list(map(int, input().split()))
# d.append(v)
#
# max = 0
# for i in range(n - m + 1):
# for j in range(n - m + 1):
# if max < f(i, j):
# max = f(i, j)
# print(max)
# d = input()
# c = input()
# if d.__contains__(c):
# print('O')
# else:
# print('X')
# a = 'hello world'
# b = 'world'
# print(a.__contains__(b))
# m = int(input())
# print(3 * m + 1)
# 0 1 2 3 4 5 6 7 8 * 12 96 49
# 5 0 2 3 2 0 5 0
'''
print('2023/06/08')
'''
# n = 0
# a = 0
# l = int(input())
# a1, a2 = map(int, input().split())
# while n < l:
# if a % 2 == 0:
# n = n + a1
# if a % 3 == 0:
# n = n + a2
# a = a + 1
# a = a + 1
# y = 2023
# m = 1
# d = 1
#
# if y % 400 == 0 or (y % 4 == 0 and y % 100 != 0):
# k = 1
# else:
# k = 0
#
# while a > 364 + k:
# y = y + 1
# a = a - 364 - k
# if y % 400 == 0 or (y % 4 == 0 and y % 100 != 0):
# k = 1
# else:
# k = 0
#
# if a > 28:
# while a >= 28 + k or (a >= 30 and (m == 4 or m == 6 or m == 9 or m == 11)) or (a >= 31 and (m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12)):
# if y % 400 == 0 or (y % 4 == 0 and y % 100 != 0):
# k = 1
# else:
# k = 0
# if m == 1:
# m = m + 1
# a = a - 31
# elif m == 2:
# m = m + 1
# a = a - 28 - k
# elif m == 3:
# m = m + 1
# a = a - 31
# elif m == 4:
# m = m + 1
# a = a - 30
# elif m == 5:
# m = m + 1
# a = a - 31
# elif m == 6:
# m = m + 1
# a = a - 30
# elif m == 7:
# m = m + 1
# a = a - 31
# elif m == 8:
# m = m + 1
# a = a - 31
# elif m == 9:
# m = m + 1
# a = a - 30
# elif m == 10:
# m = m + 1
# a = a - 31
# elif m == 11:
# m = m + 1
# a = a - 30
# elif m == 12:
# m = 1
# y = y + 1
# a = a - 31
# d = d + a
#
# print('%04d' % y, '/', '%02d' % m, '/', '%02d' % d, sep='')
/*
#include <stdio.h>
long long int d[501][501] = {}, n, m, c[501][501] = {};
long long int f(int a, int b){
long long int k = 0;
if(c[a][b] != 0) return c[a][b];
if(b == 0){
for(int i = 0 ; i < m ; i++){
for(int j = 0 ; j < m ; j++){
k += d[a + i][b + j];
}
}
c[a][b] = k;
}
else{
for(int i = 0 ; i < m ; i++){
k += d[a + i][b + m - 1] - d[a + i][b - 1];
}
c[a][b] = c[a][b - 1] + k;
}
return c[a][b];
}
int main()
{
scanf("%lld %lld", &n, &m);
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
scanf("%d", &d[i][j]);
}
}
long long int max = 0;
for(int i = 0 ; i < n - m + 1 ; i++){
for(int j = 0 ; j < n - m + 1 ; j++){
if(max < f(i, j)){
max = c[i][j];
}
}
}
printf("%lld", max);
return 0;
}
*/
/*
#include <stdio.h>
int main(){
int n, arr[106] = {}, d[106] = {}, b = 0, k = 0;
scanf("%d", &n);
for(int i = 0 ; i < n ; i++){
scanf("%d", &arr[i]);
if(i > 0){
d[i] = arr[i] - arr[i - 1];
}
}
for(int i = 1 ; i < n ; i++){
if(d[i] > 0){
if(k < 2 * d[i]){
b += 2 * d[i] - k;
k = 0;
}
else{
k = k - 2 * d[i];
}
}
else{
k -= d[i] / 2;
}
}
printf("%d", b);
return 0;
}
*/