description
stringlengths 116
4.23k
| code
stringlengths 9
53.6k
| sample_inputs
stringlengths 0
914
| sample_outputs
stringlengths 0
1.33k
| normalized_code
stringlengths 25
86.1k
|
---|---|---|---|---|
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print(ord(' 3 '[int(input())%14])) | 276 | 52 | EXPR FUNC_CALL VAR FUNC_CALL VAR STRING BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print('1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51'.split(',')[int(input())-1]) | 276 | 52 | EXPR FUNC_CALL VAR FUNC_CALL STRING STRING BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print((51,1,4,1,4,5,2,2,15,1,2,2,5,1,5,1,14,1,2,1,5,1,2,2,5,1,2,1,2,1,1,1)[-int(input())]) | 276 | 52 | EXPR FUNC_CALL VAR NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print([0,1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51][int(input())]) | 276 | 52 | EXPR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print([51,0,0,0,4,5,2,0,15,0,0,0,0,1,0,0,14,1,0,0,0,0,0,0,5,0,2,0,0,0,0,1][-int(input())]) | 276 | 52 | EXPR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print((1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51)[int(input()) - 1]) | 276 | 52 | EXPR FUNC_CALL VAR NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print([51,0,0,0,4,5,2,2,15,1,2,2,0,1,5,0,14,1,0,0,0,0,0,0,5,0,2,0,0,0,0,1][-int(input())]) | 276 | 52 | EXPR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print([51,0,0,0,4,5,0,0,15,0,0,0,0,1,0,0,14,1,0,0,0,0,0,0,5,0,2,0,0,0,0,1][-int(input())]) | 276 | 52 | EXPR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print([1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51][int(input())-1]) | 276 | 52 | EXPR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the K-th element of the following sequence of length 32:
1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
Constraints
* 1 \leq K \leq 32
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
K
Output
Print the K-th element.
Examples
Input
6
Output
2
Input
27
Output
5 | print(b' 3 '[int(input())%14]) | 276 | 52 | EXPR FUNC_CALL VAR UNKNOWN BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.
Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.
Constraints
* The length of S is between 7 and 100 (inclusive).
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
If S is a KEYENCE string, print `YES`; otherwise, print `NO`.
Examples
Input
keyofscience
Output
YES
Input
mpyszsbznf
Output
NO
Input
ashlfyha
Output
NO
Input
keyence
Output
YES | s=input();print('NYOE S'['ke'in s and'e'==s[-1]::2]) | keyenceashlfyhakeyofsciencempyszsbznf | YESNOYESNO | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING STRING VAR STRING VAR NUMBER NUMBER |
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.
Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.
Constraints
* The length of S is between 7 and 100 (inclusive).
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
If S is a KEYENCE string, print `YES`; otherwise, print `NO`.
Examples
Input
keyofscience
Output
YES
Input
mpyszsbznf
Output
NO
Input
ashlfyha
Output
NO
Input
keyence
Output
YES | s=input();n=len(s);print("YNEOS"[all(s[:i]+s[j:]!="keyence"for i in range(n)for j in range(i,n))::2]) | keyenceashlfyhakeyofsciencempyszsbznf | YESNOYESNO | ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR STRING FUNC_CALL VAR BIN_OP VAR VAR VAR VAR STRING VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR NUMBER |
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.
Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.
Constraints
* The length of S is between 7 and 100 (inclusive).
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
If S is a KEYENCE string, print `YES`; otherwise, print `NO`.
Examples
Input
keyofscience
Output
YES
Input
mpyszsbznf
Output
NO
Input
ashlfyha
Output
NO
Input
keyence
Output
YES | s=input();print('NYOE S'['f'>s[-1]and'ke'in s::2]) | keyenceashlfyhakeyofsciencempyszsbznf | YESNOYESNO | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING STRING VAR NUMBER STRING VAR NUMBER |
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.
Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.
Constraints
* The length of S is between 7 and 100 (inclusive).
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
If S is a KEYENCE string, print `YES`; otherwise, print `NO`.
Examples
Input
keyofscience
Output
YES
Input
mpyszsbznf
Output
NO
Input
ashlfyha
Output
NO
Input
keyence
Output
YES | s=input();print("YNEOS"[all("keyence"[:i]!=s[:i]or"keyence"[i-7 or len(s):]!=s[i-7 or len(s):]for i in range(8))::2]) | keyenceashlfyhakeyofsciencempyszsbznf | YESNOYESNO | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING FUNC_CALL VAR STRING VAR VAR VAR STRING BIN_OP VAR NUMBER FUNC_CALL VAR VAR VAR BIN_OP VAR NUMBER FUNC_CALL VAR VAR VAR FUNC_CALL VAR NUMBER NUMBER |
A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.
Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.
Constraints
* The length of S is between 7 and 100 (inclusive).
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
If S is a KEYENCE string, print `YES`; otherwise, print `NO`.
Examples
Input
keyofscience
Output
YES
Input
mpyszsbznf
Output
NO
Input
ashlfyha
Output
NO
Input
keyence
Output
YES | s=input();print('NYOE S'['e'==s[-1]and'ke'in s::2]) | keyenceashlfyhakeyofsciencempyszsbznf | YESNOYESNO | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING STRING VAR NUMBER STRING VAR NUMBER |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(-int(input())+sum(map(int,input().split()))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(-int(input())+sum(int(i) for i in input().split())) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(sum(map(lambda x:x-1,list(map(int,input().split()))))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | n,*a=map(int,open(0).read().split());print(sum(a)-n) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(-int(input())+eval(input().replace(" ","+"))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | a = input();print(sum(list(map(lambda x:int(x)-1,input().split())))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | N=input();print(sum(list(map(int,input().split())))-int(N)) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | n = int(input());print(sum(map(int,input().split()))-n) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | n,a=open(0);print(sum(map(int,a.split()))-int(n)) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(sum(i-1for i in list(map(int,open(0).read().split()))[1:])) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR NUMBER NUMBER |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(sum([i-1 for i in list(map(int,input().split()))])) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | n,a=int(input()),list(map(int,input().split()));print(sum(a)-n) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(sum([int(i)-1 for i in input().split()])) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(eval(input().replace(' ','-1+'))-1) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR STRING STRING NUMBER |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(0-int(input())+sum(map(int, input().split()))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | n=int(input());print(sum(list(map(int,input().split())))-n) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | N=int(input());print(sum(list(map(int,input().split())))-N) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | i = input;i();print(sum([int(x)-1 for x in i().split()])) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR VAR EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | N=input();print(sum(map(int,input().split()))-int(N)) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(sum(int(i)-1for i in input().split())) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print((lambda a,b:sum(b)-int(a))(input(),list(map(int,input().split())))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR FUNC_CALL BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | N,A=open(0);print(sum(map(int,A.split()))-int(N)) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | ASSIGN VAR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | input();print(sum(list(map(lambda x:x-1,list(map(int,input().split())))))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given N positive integers a_1, a_2, ..., a_N.
For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).
Here, X\ mod\ Y denotes the remainder of the division of X by Y.
Find the maximum value of f.
Constraints
* All values in input are integers.
* 2 \leq N \leq 3000
* 2 \leq a_i \leq 10^5
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_N
Output
Print the maximum value of f.
Examples
Input
3
3 4 6
Output
10
Input
5
7 46 11 20 11
Output
90
Input
7
994 518 941 851 647 2 581
Output
4527 | print(-int(input())+sum(list(map(int,input().split())))) | 5
7 46 11 20 117
994 518 941 851 647 2 5813
3 4 6 | 90452710 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following operation any number of times (possibly zero):
Operation: Swap two adjacent elements in the permutation.
You want to have p_i β i for all 1β€iβ€N. Find the minimum required number of operations to achieve this.
Constraints
* 2β€Nβ€10^5
* p_1,p_2,..,p_N is a permutation of 1,2,..,N.
Input
The input is given from Standard Input in the following format:
N
p_1 p_2 .. p_N
Output
Print the minimum required number of operations
Examples
Input
5
1 4 3 5 2
Output
2
Input
2
1 2
Output
1
Input
2
2 1
Output
0
Input
9
1 2 4 9 5 8 7 3 6
Output
3 | print(sum(x//2+x%2 for x in[len(list(g))for k,g in __import__("itertools").groupby([i==j for i,j in enumerate(map(int,open(0).read().split()))])if k])) | 5
1 4 3 5 29
1 2 4 9 5 8 7 3 62
1 22
2 1 | 2310 | EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR NUMBER VAR |
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.
Write a program which reads a list of N integers and prints the number of prime numbers in the list.
Constraints
1 β€ N β€ 10000
2 β€ an element of the list β€ 108
Input
The first line contains an integer N, the number of elements in the list.
N numbers are given in the following lines.
Output
Print the number of prime numbers in the given list.
Examples
Input
5
2
3
4
5
6
Output
3
Input
11
7
8
9
10
11
12
13
14
15
16
17
Output
4 | print(sum(map(lambda x: 1 if x == 2 or pow(2,x-1,x) == 1 else 0, [int(input()) for _ in range(int(input()))]))) | 5
2
3
4
5
611
7
8
9
10
11
12
13
14
15
16
17 | 34 | EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR |
One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n - 1 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play ai rounds. What is the minimum number of rounds of the "Mafia" game they need to play to let each person play at least as many rounds as they want?
Input
The first line contains integer n (3 β€ n β€ 105). The second line contains n space-separated integers a1, a2, ..., an (1 β€ ai β€ 109) β the i-th number in the list is the number of rounds the i-th person wants to play.
Output
In a single line print a single integer β the minimum number of game rounds the friends need to let the i-th person play at least ai rounds.
Please, do not use the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
3
3 2 2
Output
4
Input
4
2 2 2 2
Output
3
Note
You don't need to know the rules of "Mafia" to solve this problem. If you're curious, it's a game Russia got from the Soviet times: http://en.wikipedia.org/wiki/Mafia_(party_game). | input();A=[int(s) for s in input().split()];print(max(sum(A)//(len(A)-1)+(sum(A)%(len(A)-1)>0),max(A))) | 3
3 2 2
4
2 2 2 2
| 4
3
| EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR NUMBER BIN_OP FUNC_CALL VAR VAR BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER FUNC_CALL VAR VAR |
One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n - 1 people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play ai rounds. What is the minimum number of rounds of the "Mafia" game they need to play to let each person play at least as many rounds as they want?
Input
The first line contains integer n (3 β€ n β€ 105). The second line contains n space-separated integers a1, a2, ..., an (1 β€ ai β€ 109) β the i-th number in the list is the number of rounds the i-th person wants to play.
Output
In a single line print a single integer β the minimum number of game rounds the friends need to let the i-th person play at least ai rounds.
Please, do not use the %lld specifier to read or write 64-bit integers in Π‘++. It is preferred to use the cin, cout streams or the %I64d specifier.
Examples
Input
3
3 2 2
Output
4
Input
4
2 2 2 2
Output
3
Note
You don't need to know the rules of "Mafia" to solve this problem. If you're curious, it's a game Russia got from the Soviet times: http://en.wikipedia.org/wiki/Mafia_(party_game). | n=int(input());a=list(map(int,input().split()));print(max(max(a),(sum(a)+(n-2))//(n-1))) | 3
3 2 2
4
2 2 2 2
| 4
3
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR BIN_OP BIN_OP FUNC_CALL VAR VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(25) | 2
| 25
| EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | x = input("25") | 2
| 25
| ASSIGN VAR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(25); | 2
| 25
| EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(pow(5, int(input()), 100)) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(25, end='') | 2
| 25
| EXPR FUNC_CALL VAR NUMBER STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(5) if int(input()) == 1 else print(25) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR NUMBER FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = input(); print(25); | 2
| 25
| ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print ('25') | 2
| 25
| EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print("25") | 2
| 25
| EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | a=int(input());print(25) | 2
| 25
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print (25) | 2
| 25
| EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(''.join([str(int(i)**2) for i in list(str(5))])) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = input();print('25' if int(n) != 1 else '5') | 2
| 25
| ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER STRING STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print('25') | 2
| 25
| EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print ( 5**2 ) | 2
| 25
| EXPR FUNC_CALL VAR BIN_OP NUMBER NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | input();print("25") | 2
| 25
| EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(0 * int(input()) + 25) | 2
| 25
| EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | input(); print(25) | 2
| 25
| EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | input("25") | 2
| 25
| EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = int(input()); print("25") | 2
| 25
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | if __name__ == '__main__': print(pow(5, int(input()), 100)) | 2
| 25
| IF VAR STRING EXPR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(pow(5,2)) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | input();print(25) | 2
| 25
| EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(5 if int(input()) == 1 else 25) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | a=input();print("25") | 2
| 25
| ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | if __name__ == '__main__': print(25) | 2
| 25
| IF VAR STRING EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | k = 5; n = int(input()); print(25) | 2
| 25
| ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n=input();print(25) | 2
| 25
| ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(str(pow(5,int(input()),100 ))[-2:]) | 2
| 25
| EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print("25"[int(input())<2::]) | 2
| 25
| EXPR FUNC_CALL VAR STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = int(input());print(25) | 2
| 25
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | if int(input()): print(25) | 2
| 25
| IF FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | print(20 * (int(input()) > 1) + 5) | 2
| 25
| EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | N = int(input());print(25) | 2
| 25
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = input('25') | 2
| 25
| ASSIGN VAR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | exec('input(); print(25)') | 2
| 25
| EXPR FUNC_CALL VAR STRING |
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" β the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."
Could you pass the interview in the machine vision company in IT City?
Input
The only line of the input contains a single integer n (2 β€ n β€ 2Β·1018) β the power in which you need to raise number 5.
Output
Output the last two digits of 5n without spaces between them.
Examples
Input
2
Output
25 | n = int(input()); print(25); | 2
| 25
| ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBER |
You are given a complete undirected graph. For each pair of vertices you are given the length of the edge that connects them. Find the shortest paths between each pair of vertices in the graph and return the length of the longest of them.
Input
The first line of the input contains a single integer N (3 β€ N β€ 10).
The following N lines each contain N space-separated integers. jth integer in ith line aij is the length of the edge that connects vertices i and j. aij = aji, aii = 0, 1 β€ aij β€ 100 for i β j.
Output
Output the maximum length of the shortest path between any pair of vertices in the graph.
Examples
Input
3
0 1 1
1 0 4
1 4 0
Output
2
Input
4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0
Output
5
Note
You're running short of keywords, so you can't use some of them:
define
do
for
foreach
while
repeat
until
if
then
else
elif
elsif
elseif
case
switch
| exec(""" n = i@nt(in@put()) a = [li@st(m@ap(in@t, in@put().s@plit())) f@or i i@n ra@nge(n)] f@or k i@n r@ange(n): f@or i i@n ra@nge(n): fo@r j i@n ra@nge(n): a[i][j] = m@in(a[i][j], a[i][k] + a[k][j]) an@s = 0 fo@r i i@n ra@nge(n): f@or j i@n ra@nge(n): a@ns = ma@x(an@s, a[i][j]) pr@int(a@ns) """.replace("@", "")) | 3
0 1 1
1 0 4
1 4 0
4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0
| 25 | EXPR FUNC_CALL VAR FUNC_CALL STRING STRING STRING |
You are given a complete undirected graph. For each pair of vertices you are given the length of the edge that connects them. Find the shortest paths between each pair of vertices in the graph and return the length of the longest of them.
Input
The first line of the input contains a single integer N (3 β€ N β€ 10).
The following N lines each contain N space-separated integers. jth integer in ith line aij is the length of the edge that connects vertices i and j. aij = aji, aii = 0, 1 β€ aij β€ 100 for i β j.
Output
Output the maximum length of the shortest path between any pair of vertices in the graph.
Examples
Input
3
0 1 1
1 0 4
1 4 0
Output
2
Input
4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0
Output
5
Note
You're running short of keywords, so you can't use some of them:
define
do
for
foreach
while
repeat
until
if
then
else
elif
elsif
elseif
case
switch
| exec(""" from queue import PriorityQueue INF = 1000000 n = int(input()) g = [[int(x) fo"""+"""r x in input().split()] fo"""+"""r _ in range(n)] diam = 0 fo"""+"""r start in range(n): d = [INF fo"""+"""r i in range(n)] q = PriorityQueue() q.put((0, start)) whi"""+"""le not q.empty(): dist, i = q.get() i"""+"""f d[i] != INF: continue d[i] = dist fo"""+"""r j in range(n): q.put((d[i] + g[i][j], j)) diam = max(diam, max(d)) print(diam) """) | 3
0 1 1
1 0 4
1 4 0
4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0
| 25 | EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP BIN_OP BIN_OP BIN_OP BIN_OP STRING STRING STRING STRING STRING STRING STRING STRING |
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.
Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third β by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.
The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.
Input
The first line contains a single integer a (1 β€ a β€ 1000) β the initial position of the first friend.
The second line contains a single integer b (1 β€ b β€ 1000) β the initial position of the second friend.
It is guaranteed that a β b.
Output
Print the minimum possible total tiredness if the friends meet in the same point.
Examples
Input
3
4
Output
1
Input
101
99
Output
2
Input
5
10
Output
9
Note
In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.
In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.
In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend β two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9. | x=int(input());y = int(input());print((abs(x - y) + 1) ** 2 // 4) | 3
4
5
10
101
99
| 192 | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER NUMBER NUMBER |
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.
Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third β by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.
The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.
Input
The first line contains a single integer a (1 β€ a β€ 1000) β the initial position of the first friend.
The second line contains a single integer b (1 β€ b β€ 1000) β the initial position of the second friend.
It is guaranteed that a β b.
Output
Print the minimum possible total tiredness if the friends meet in the same point.
Examples
Input
3
4
Output
1
Input
101
99
Output
2
Input
5
10
Output
9
Note
In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.
In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.
In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend β two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9. | from math import ceil as c;d=abs(int(input())-int(input()));print((c(d/2)*(c(d/2)+1))//2+((d//2)*((d//2)+1))//2) | 3
4
5
10
101
99
| 192 | ASSIGN VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER BIN_OP BIN_OP BIN_OP VAR NUMBER BIN_OP BIN_OP VAR NUMBER NUMBER NUMBER |
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.
Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third β by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.
The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.
Input
The first line contains a single integer a (1 β€ a β€ 1000) β the initial position of the first friend.
The second line contains a single integer b (1 β€ b β€ 1000) β the initial position of the second friend.
It is guaranteed that a β b.
Output
Print the minimum possible total tiredness if the friends meet in the same point.
Examples
Input
3
4
Output
1
Input
101
99
Output
2
Input
5
10
Output
9
Note
In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.
In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.
In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend β two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9. | print((lambda x,y:((abs(x-y)//2)*(abs(x-y)//2+1))//2+(((abs(x-y))-abs(x-y)//2)*(abs(x-y)-abs(x-y)//2+1)//2))(int(input()),int(input()))) | 3
4
5
10
101
99
| 192 | EXPR FUNC_CALL VAR FUNC_CALL BIN_OP BIN_OP BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER NUMBER NUMBER BIN_OP BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP BIN_OP FUNC_CALL VAR BIN_OP VAR VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR |
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.
Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third β by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.
The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.
Input
The first line contains a single integer a (1 β€ a β€ 1000) β the initial position of the first friend.
The second line contains a single integer b (1 β€ b β€ 1000) β the initial position of the second friend.
It is guaranteed that a β b.
Output
Print the minimum possible total tiredness if the friends meet in the same point.
Examples
Input
3
4
Output
1
Input
101
99
Output
2
Input
5
10
Output
9
Note
In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.
In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.
In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend β two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9. | a=int(input());b=int(input());c=abs(a-b)//2;d=abs(a-b)-c;print(c*(c+1)//2+d*(d+1)//2) | 3
4
5
10
101
99
| 192 | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR BIN_OP VAR NUMBER NUMBER BIN_OP BIN_OP VAR BIN_OP VAR NUMBER NUMBER |
Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1 = a, another one is in the point x2 = b.
Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third β by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.
The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.
Input
The first line contains a single integer a (1 β€ a β€ 1000) β the initial position of the first friend.
The second line contains a single integer b (1 β€ b β€ 1000) β the initial position of the second friend.
It is guaranteed that a β b.
Output
Print the minimum possible total tiredness if the friends meet in the same point.
Examples
Input
3
4
Output
1
Input
101
99
Output
2
Input
5
10
Output
9
Note
In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.
In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.
In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend β two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9. | import math;a=int(input());b=int(input());print((math.ceil(abs(a-b)/2))*((math.ceil(abs(a-b)/2)) + 1)//1 - (((a-b)%2))*(math.ceil(abs(a-b)/2)) ) | 3
4
5
10
101
99
| 192 | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP FUNC_CALL VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER NUMBER NUMBER BIN_OP BIN_OP BIN_OP VAR VAR NUMBER FUNC_CALL VAR BIN_OP FUNC_CALL VAR BIN_OP VAR VAR NUMBER |
You are given a chessboard of size 1 Γ n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".
Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is known that the total number of pieces equals to <image>.
In one step you can move one of the pieces one cell to the left or to the right. You cannot move pieces beyond the borders of the board. You also cannot move pieces to the cells that are already occupied.
Your task is to place all the pieces in the cells of the same color using the minimum number of moves (all the pieces must occupy only the black cells or only the white cells after all the moves are made).
Input
The first line of the input contains one integer n (2 β€ n β€ 100, n is even) β the size of the chessboard.
The second line of the input contains <image> integer numbers <image> (1 β€ pi β€ n) β initial positions of the pieces. It is guaranteed that all the positions are distinct.
Output
Print one integer β the minimum number of moves you have to make to place all the pieces in the cells of the same color.
Examples
Input
6
1 2 6
Output
2
Input
10
1 2 3 4 5
Output
10
Note
In the first example the only possible strategy is to move the piece at the position 6 to the position 5 and move the piece at the position 2 to the position 3. Notice that if you decide to place the pieces in the white cells the minimum number of moves will be 3.
In the second example the possible strategy is to move <image> in 4 moves, then <image> in 3 moves, <image> in 2 moves and <image> in 1 move. | print((lambda n, a: min(sum(abs(x - i) for i, x in zip(range(s, n + 1, 2), a)) for s in [1,2]))(int(input()), sorted(map(int, input().split())))) | 10
1 2 3 4 5
6
1 2 6
| 10
2
| EXPR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR BIN_OP VAR NUMBER NUMBER VAR VAR LIST NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(int(input())*6.283) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(int(input())*6.283184) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(float(input())*2*3.14) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(float(input())*2*3.1415926) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(3.14 * 2 * int(input())) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(2*3.1415926*int(input())) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(2*3.14*int(input())) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(2*int(input())*3.14159265) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(2*3.1415*int(input())) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(int(input())*3.14*2) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(int(input())*2*3.14) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
Print the circumference of a circle of radius R.
Constraints
* 1 \leq R \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
R
Output
Print the circumference of the circle. Your output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.
Examples
Input
1
Output
6.28318530717958623200
Input
73
Output
458.67252742410977361942 | print(float(input())*2*3.14159) | 731 | 458.672527424109773619426.28318530717958623200 | EXPR FUNC_CALL VAR BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER |
Subsets and Splits