Problem:


Score : 100 points

Problem Statement

There are two rectangles.
The lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.
The lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.

Print the area of the rectangle with the larger area.
If the two rectangles have equal areas, print that area.

Constraints

All input values are integers.

1≤A≤10^4

1≤B≤10^4

1≤C≤10^4

1≤D≤10^4

Input

The input is given from Standard Input in the following format:

A B C D

Output

Print the area of the rectangle with the larger area.
If the two rectangles have equal areas, print that area.

Sample Input 1

3 5 2 7

Sample Output 1

15

The first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.
Thus, the output should be 15, the larger area.

Sample Input 2

100 600 200 300

Sample Output 2

60000



Sample input:
3 5 2 7


Sample output:
15

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c, d = LI()
    print(max(a * b, c * d))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split(" "))
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a*b > c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:

A,B,C,D = map(int,input().split())

print ( max(A*B , C*D ))

Submission status: Accepted

Solution code:
def main():
    a,b,c,d=map(int,input().split(' '))
    print(max(a*b,c*d))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
[A,B,C,D] = list(map(int,input().split()))
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC52 A

a,b,c,d = map(int,input().split())

print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
ab= a*b
cd= c*d
if ab==cd:print(ab)
else:print(max(ab,cd))

Submission status: Accepted

Solution code:
a, b, c, d = (int(x) for x in input().split())
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# input
A, B, C, D = map(int, input().split())

# solve & output
print(max(A * B, C * D))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())

ab = a * b
cd = c * d

if ab >= cd:
    print(ab)
else:
    print(cd)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if a * b > c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
x = a*b
y = c*d

if x<=y:
    print(y)
else:
    print(x)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
ab = a * b
cd = c * d
print(ab if ab > cd else cd)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

firstSquare = A * B
secondSquare = C * D

print(max(firstSquare, secondSquare))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

f = a * b
s = c * d

if f >= s:
    print(f)
else:
    print(s)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

if A * B > C * D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
s1 = A * B
s2 = C * D

if s1 > s2:
    print(s1)
else:
    print(s2)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
x = a*b
y = c*d
if x>=y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if(A*B >= C*D):
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

ab = A * B
cd = C * D

print(max(ab, cd))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = a[0]*a[1]
c = a[2]*a[3]

if b > c:
  print(b)
else:
  print(c)

Submission status: Accepted

Solution code:
inp = input().split()
a = int(inp[0])
b = int(inp[1])
c = int(inp[2])
d = int(inp[3])

if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())

print(max([a*b,c*d]))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

s1 = A * B
s2 = C * D

if s1 <= s2:
  print(int(s2))
else:
  print(int(s1))

Submission status: Accepted

Solution code:
a, b, c, d =map(int, input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(str(max(A*B, C*D)))

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A, B, C, D = nl()

if A*B > C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a * b >= c * d:
    print(a * b)
elif a * b < c * d:
    print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

one = a * b
two = c * d

print(max(one, two))

Submission status: Accepted

Solution code:
first=input()
(A, B, C, D)=first.split()
A=int(A)
B=int(B)
C=int(C)
D=int(D)
answer1=A*B
answer2=C*D
if (A*B)>(C*D):
  print(answer1)
elif (A*B)<=(C*D):
  print(answer2)

Submission status: Accepted

Solution code:
sc = input()
(a,b,c,d) = sc.split()
x = int(a)*int(b)
y = int(c)*int(d)
if x > y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
first = input()
(sA, sB, sC,sD) = first.split()
ab = int(sA)*int(sB)
cd = int(sC)*int(sD)
if ab>cd:
    print(ab)
else:
    print(cd)

Submission status: Accepted

Solution code:
(A, B, C, D) = map(int, input().split())
print(max(A*B, C*D))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    line = input()
    (sA, sB, sC, sD) = line.split()
    A = int(sA)
    B = int(sB)
    C = int(sC)
    D = int(sD)
    area1 = A * B
    area2 = C * D
    if area1 > area2:
        answer = area1
    else:
        answer = area2
    print(answer)

main()

Submission status: Accepted

Solution code:
A,B,C,D  =  list(map(int,input().split(' ')))

AB = A*B
CD = C*D
if AB == CD:
  print(AB)
else:
  print(max(AB,CD))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print(int(max(a*b,c*d)))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
print([A*B,C*D][A*B<C*D])

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
print(max(A * B, C * D))

Submission status: Accepted

Solution code:
def abc():
    a, b, c, d = map(int, input().split())
    print(max(a * b, c * d))


abc()

Submission status: Accepted

Solution code:
# A問題
a, b, c, d = map(int, input().split())
if a * b >= c * d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a * b <= c * d:
    print(c*d)
else:
    print(a*b)

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().split()))
if A * B >= C * D:
    print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
a,b,c,d=(int(i) for i in input().split())
if (a*b>c*d):
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
x = a * b
y = c * d
if x > y:
    print(x)
elif y > x:
    print(y)
else:
    print(x)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b, c, d = map(int, input().split())

print(max(a*b, c*d))

Submission status: Accepted

Solution code:
A,B,C,D = list(map(int,input().split(" ")))
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
ab = a*b
cd = c*d
if ab > cd:
    print(ab)
else:
    print(cd)

Submission status: Accepted

Solution code:
A, B, C, D = [int(x) for x in input().split()]
print(A*B) if A*B >= C*D else print(C*D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

# print(a)
# print(b)
# print(c)
# print(d)

area1 = a * b
area2 = c * d

# print(area1)
# print(area2)

if area1 == area2:
    print(area1)
elif area1 > area2:
    print(area1)
else:
    print(area2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Two Rectangles
https://atcoder.jp/contests/abc052/tasks/abc052_a

"""
import sys


def solve(A, B, C, D):
    return max(A*B, C*D)


def main(args):
    A, B, C, D = map(int, input().split())
    ans = solve(A, B, C, D)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
def larger(x, y):
	if x > y: return x
	return y

A, B, C, D = map(int, input().split())
print(larger(A*B, C*D))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split(' '))

sum_A = A * B
sum_B = C * D

if sum_A > sum_B:
    print(sum_A)
else:
    print(sum_B)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, raw_input().split())
x = a * b
y = c * d
if x > y:
    print x
else:
    print y

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

A,B,C,D = map(int,input().split())
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print(a*b if a*b > c*d else c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())

if a*b>c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())

ract_x = A * B
ract_y = C * D

if ract_x > ract_y:
    print(ract_x)
else:
    print(ract_y)

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

A,B,C,D = mi()

print(max(A*B, C*D))

Submission status: Accepted

Solution code:
a, b, c, d = [ int(v) for v in input().split() ]

print(max(a*b,c*d))

Submission status: Accepted

Solution code:
A, B, C, D = input().split()

print(max(int(A) * int(B), int(C) * int(D)))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a * b == c * d:
  print(a * b)
else:
  print(max(a * b, c * d))

Submission status: Accepted

Solution code:
input_data=input().split()


first_area = int(input_data[0]) * int(input_data[1])
second_area = int(input_data[2]) * int(input_data[3])

if first_area >= second_area :
  print(first_area)
else:
  print(second_area)

Submission status: Accepted

Solution code:
import sys
import math

a,b,c,d=map(int,input().split())

if a*b>=c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
# 入力
# スペース区切りの整数の入力(定数)
a, b, c, d = map(int, input().split())

#　計算と出力
if a*b >= c*d :
    print(a*b)
else :
    print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if A * B >= C * D:
    print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print((A*B) if (A*B)>(C*D) else (C*D));

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())

if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

one = l[0] * l[1]
two = l[2] * l[3]

if one < two:
    print(two)
else:
    print(one)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if(a*b>c*d):
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

print(max([A*B,C*D]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def solve(A, B, C, D):
    print(A*B if A*B>C*D else C*D)

if __name__ == '__main__':
    A, B, C, D = map(int, input().split())
    
    solve(A, B, C, D)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b>=c*d:
  print(int(a*b))
else:
  print(int(c*d))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
S1, S2 = A * B, C * D
print(S1 if S1 >= S2 else S2)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if (A * B) > (C * D):
    print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
a,b,c,d=map(int, input().split(" "))
print(a*b if a*b>c*d else c*d)

Submission status: Accepted

Solution code:
a, b, c, d =[int(i) for i in input().split()]
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print(max([a*b,c*d]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print(a*b if a*b>c*d else c*d)

Submission status: Accepted

Solution code:
a, b, c, d = [int(n) for n in input().split()]
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

x = a * b
y = c * d

if x > y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print(a*b if a*b>=c*d else c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if A*B > C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
print(max(A*B, C*D))

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
print(A*B if A*B>C*D else C*D)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().rstrip().split(' '))

if a*b > c*d :
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())

A=a*b
C=c*d

print(int(max(A,C)))

Submission status: Accepted

Solution code:
def main():
	A, B, C, D = map(int, input().split())
	print(max(A*B, C*D))


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = a[0] * a[1]
c = a[2] * a[3]

if b > c:
  print(b)
else:
  print(c)

Submission status: Accepted

Solution code:


def read_input():
    a, b, c, d = map(int, input().split())
    return a*b, c*d

def submit():
    a, b = read_input()

    print(max(a, b))

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

print(A*B if A*B >= C*D else C*D)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
print(a*b if c*d<a*b else c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if a * b > c * d:
    print(a * b)
elif a * b == c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
x=a*b
y=c*d
if x>y:
    print(x)
elif y>x:
    print(y)
else:
    print(x)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
sq1 = a * b
sq2 = c * d
sq = max(sq1,sq2)
print(sq)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
X = A * B
Y = C * D
if X > Y:
    print(X)
else:
    print(Y)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if(a * b < c * d):
    print(c * d)
elif(a * b > c * d):
    print(a * b)
else:
    print(a * b)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
S1 = A * B
S2 = C * D
print(max(S1, S2))

Submission status: Accepted

Solution code:
a, b, c, d = (int(i) for i in input().split())  
print(int(max(a*b,c*d)))

Submission status: Accepted

Solution code:
a,b,c,d=input().split()

x=int(a)*int(b)
y=int(c)*int(d)

if x>y:
    print(x)

elif x<y:
    print(y)

else:
    print(x)

Submission status: Accepted

Solution code:
import functools

import os
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def Yesif(cond):
    print('Yes' if cond else 'No')


def YESIF(cond):
    print('YES' if cond else 'NO')


def yesif(cond):
    print('yes' if cond else 'no')



a, b, c , d = inl()
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
# ABC052A - Two Rectangles
a, b, c, d = list(map(int, input().rstrip().split()))
print(max(a * b, c * d))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if(a*b==c*d):
    print(a*b)
else:
    print(max(a * b, c * d))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(max(a[0]*a[1],a[2]*a[3]))

Submission status: Accepted

Solution code:
A, B, C, D=map(int, input().split())

X=A*B
Y=C*D

print(X) if X>=Y else print(Y)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
s = a*b
t = c*d 
if s > t:
    print(s)
else:
    print(t)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
A=a*b
B=c*d
print(A if A>=B else B)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d = [int(i) for i in input().split(" ")]
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a, b, c, d = [int(item) for item in input().split()]
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if A*B <= C*D:
    print(C*D)
else:
    print(A*B)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
a1 = a*b
a2 = c*d
if a1 > a2:
    print(a1)
elif a1<a2:
    print(a2)
else:
    print(a1)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
b = a[0]*a[1]
c = a[2]*a[3]
if b >= c:
    print(b)
else:
    print(c)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    A = list(map(int, input().split()))
    return max(A[0] * A[1], A[2] * A[3])


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
ans = max(a*b,c*d)
print(ans)

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,c,d = f()
    print(max(a*b, c*d))

solve()

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
s1 = a*b
s2 = c*d
if s1 >= s2:
  print(s1)
else:
  print(s2)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b <= c*d:
  print(c*d)
else:
  print(a*b)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
mx=max(a*b,c*d)
print(mx)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if a[0] * a[1] == a[2] * a[3]:
  print(a[0]*a[1])
elif a[0] * a[1] > a[2] * a[3]:
  print(a[0]*a[1])
else:
  print(a[2]*a[3])

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

if A*B > C*D:
  print(A*B)
else:
  print(C*D)

Submission status: Accepted

Solution code:
from sys import stdin

a, b, c, d = [int(x) for x in stdin.readline().rstrip().split()]
if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(max([A*B,C*D]))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
men_1 = A * B
men_2 = C * D
print(max(men_1, men_2))

Submission status: Accepted

Solution code:
from functools import reduce

def main():
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    

    a, b, c, d = (int(_) for _ in input().split())  
    print(max(a*b,c*d))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(max([A*B, C*D]))

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
print(max([A[0] * A[1], A[2] * A[3]]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())

if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())

if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a*b>=c*d :
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

a,b,c,d = map(int, input().split())

X=a*b
Y=c*d

if X==Y:
    print(X)
elif X>Y:
    print(X)
elif Y>X:
    print(Y)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

if A*B >= C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
def two_rectangles(A: int, B: int, C: int, D: int)->int:
    return max(A*B, C*D)


if __name__ == "__main__":
    A, B, C, D = map(int, input().split())
    ans = two_rectangles(A, B, C, D)
    print(ans)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if A*B >C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
a,b,c,d=map(int, input().split())
print(a*b*int(a*b>=c*d)+c*d*int(a*b<c*d))

Submission status: Accepted

Solution code:
L = list(map(int, input().split()))
print(max(L[0]*L[1], L[2]*L[3]))

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
print(max(A[0]*A[1],A[2]*A[3]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print( max ( a * b , c * d ))

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
a,b,c,d = LI()
print(max(a*b,c*d))
#B

#C
"""
def factor(n):
    i = 2
    m = n
    while m >= i:
        while m%i == 0:
            m //= i
            d[i] += 1
            d[i] %= mod
            if m < i:break
        i += 1
n = I()
d = defaultdict(int)
for i in range(2,n+1):
    factor(i)
ans = 1
for i in d.values():
    ans *= i+1
    ans %= mod
print(ans)
"""

#D
"""
n,a,b = LI()
x = LI()
ans = 0
for i in range(n-1):
    if a*(x[i+1]-x[i]) > b:
        ans += b
    else:
        ans += a*(x[i+1]-x[i])
print(ans)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if a[0]*a[1] > a[2]*a[3]:
  print(a[0]*a[1])
else:
  print(a[2]*a[3])

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split(' '))
x=a*b
y=c*d
print(max(x,y))

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
n1=A*B
n2=C*D
ans=max(n1,n2)
print(ans)

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().split()))

if A*B >= C*D:
	print(A*B)
else:
	print(C*D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
x = a * b
y = c * d
print(max(x, y))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b, c, d = map(int, input().split())
square1 = a * b
square2 = c * d

if square1 == square2:
    print(square1)
elif square1 > square2:
    print(square1)
else:
    print(square2)

Submission status: Accepted

Solution code:
[A,B,C,D] = list(map(int,input().split()))
s1 = A*B
s2 = C*D
print(max(s1,s2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a,b,c,d = map(int,input().split())

print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a*b < c*d:
    a,b = c,d
print(a*b)

Submission status: Accepted

Solution code:
A,B,C,D=[int(i) for i in input().split()]
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
a, b, c, d = (int(i) for i in input().split())

print(max(a*b, c*d))

Submission status: Accepted

Solution code:
A,B,C,D = [int(x) for x in input().split()]
ans = A*B if A*B>C*D else C*D
print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
from collections import Counter
from itertools import product
from math import factorial

# prime numbers
primes = list(range(int(10**5) + 1))
primes[1] = 0
for i in range(2, int(len(primes) ** 0.5) + 1):
    if primes[i]:
        for j in range(2 * i, len(primes), i):
            primes[j] = 0

def main():
    A, B, C, D = LI()
    return max(A * B, C * D)

print(main())

Submission status: Accepted

Solution code:
#52
a, b, c, d = map(int, input().split())
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    print(max(A*B, C*D))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if (A*B)==(C*D):
    print(A*B)
elif (A*B)>(C*D):
    print(A*B)
elif (A*B)<(C*D):
    print(C*D)

Submission status: Accepted

Solution code:
a,s,d,f=map(int,input().split())
if a*s>d*f:
  print(a*s)
else:
  print(d*f)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if(a*b > c*d):
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split(' '))
print(str(max(A*B,C*D)))

Submission status: Accepted

Solution code:
a,b,c,d = (int(x) for x in input().split())

s1 = a*b
s2 = c*d

if s1>=s2:
    print(s1)
else:
    print(s2)

Submission status: Accepted

Solution code:
def main() -> None:
    A, B, C, D = map(int, input().split())
    print(max(A * B, C * D))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,C,D=input().split()
A=int(A)
B=int(B)
C=int(C)
D=int(D)
if A*B>C*D :
    print(A*B)
elif A*B==C*D :
    print(A*B)
else :
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(
    max(A*B,
        C*D
        )
)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
x = a*b
y = c*d
if x!= y:
  print(max(x,y))
elif x==y:
  print(x)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if (a * b < c * d):
	print(c * d)
else:
	print(a * b)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
s = A*B if A*B>=C*D else C*D
print(s)

Submission status: Accepted

Solution code:
#08:10
h1, w1, h2, w2 = map(int, input().split())
rect1 = h1*w1
rect2 = h2*w2
if rect1 == rect2:
    print(rect1)
else:
    print(max(rect1,rect2))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
print(A*B if A*B > C*D else C*D)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(max((a[0]*a[1]), (a[2]*a[3])))

Submission status: Accepted

Solution code:
a,b,c,d=[int(i) for i in input().split()]
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print(max([a*b,c*d]))

Submission status: Accepted

Solution code:
a,b,c,d = input().split()
area = lambda length, width: length * width
area1 = area(int(a),int(b))
area2 =area(int(c),int(d))
if(area1 >= area2):
    print(area1)
else:
    print(area2)

Submission status: Accepted

Solution code:
from sys import stdin
a, b, c, d = [int(x) for x in stdin.readline().rstrip().split()]
if a*b > c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
ab = a*b
cd = c*d

if ab > cd:
    print(ab)
elif ab < cd:
    print(cd)
else:
    print(ab)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a*b>=c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
areas = [A * B, C * D]
print(max(areas))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
area1 = A * B
area2 = C * D
print(area1 if area1 >= area2 else area2)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print(a * b) if (a * b) >= (c * d) else print(c * d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
res = max(a*b,c*d)
print(res)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
print(a*b) if a*b>c*d else print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())

if(A*B >= C*D):
  print(A*B)
else:
  print(C*D)