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

Solution (Python):
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	a, b, c, d = LI()
	print(max(a*b,c*d))


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b, c, d = M()
x = a*b
y = c*d
print(max(x, y))

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

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

Solution (Python):

lst = input().split()


for i in range(len(lst)):
   lst[i] = int(lst[i])


area1 = lst[0] * lst[1]
area2 = lst[2] * lst[3]

areas = [area1, area2]
areas.sort()


print(areas[1])

Solution (Python):

lst = input().split()


for i in range(len(lst)):
   lst[i] = int(lst[i])


area1 = lst[0] * lst[1]
area2 = lst[2] * lst[3]


areas = [area1, area2]
areas.sort()


print(areas[1])

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

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



rectangle_x = a * b
rectangle_y = c * d

if rectangle_x > rectangle_y:
    print(rectangle_x)
elif rectangle_x < rectangle_y:
    print(rectangle_y)
else:
    print(rectangle_x)

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

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

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

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

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

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

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

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

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

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

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


ans1 = A*B
ans2 = C*D

if ans1 == ans2:
  print(ans1)
elif ans1 > ans2:
  print(ans1)
else:
  print(ans2)

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Rect1 = int(A*B)

Rect2 = int(C*D)

if (Rect1 > Rect2):
    print(Rect1)

elif (Rect1 < Rect2):
    print(Rect2)

else:
    print(Rect1)

Solution (Python):
def actual(A, B, C, D):
    area1 = A * B
    area2 = C * D

    if area1 >= area2:
        return area1

    return area2

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

Solution (Python):


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

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

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

Solution (Python):
def main():
    A, B, C, D = map(int, input().split())
    x = A * B
    y = C * D
    if x > y:
        print(x)
    else:
        print(y)
main()

Solution (Python):
def INT():
    return int(input())

def MI():
    return map(int, input().split())

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

A, B, C, D = MI()

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

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

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

Solution (Python):
A,B,C,D = map(int,input().split())
x = A*B
y = C*D

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

Solution (Python):

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

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

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

Solution (Python):
import sys
A,B,C,D = map(int,input().split())
if A > 10000 or B > 10000 or C > 10000 or D > 10000:
    sys.exit()
if A * B >= C * D:
    print(A*B)
    sys.exit()
if A * B <= C*D:
    print(C*D)
    sys.exit()

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

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

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

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

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

Solution (Python):
i = [int(s) for s in input().split()]
a = i[0] * i[1]
at = i[2] * i[3]
if a < at:
    print(at)
else:
    print(a)

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

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

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

a = A*B
b = C*D
print(max(a,b))

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
ns=input()

nsl=ns.split(' ')

nl=[]

for i in range(4):
  nl.append(int(nsl[i]))

if nl[0]*nl[1]>=nl[2]*nl[3]:
  print(nl[0]*nl[1])
else:
  print(nl[2]*nl[3])

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

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

s_1 = a * b
s_2 = c * d

if s_1 == s_2:
  print(s_2)
else:
  print(max(s_1, s_2))

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c,d = map(int,input().split())
m = a * b
n = c * d

if m >= n:
    print(m)
else:
    print(n)

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

Solution (Python):
A,B,C,D = (int(x) for x in input().split())
area1 = A*B
area2 = C*D
if(area1 > area2):
    print(area1)
elif(area1 < area2):
    print(area2)
else:
    print(area1)

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

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

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

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()

from collections import defaultdict, deque, Counter
from sys import exit
import heapq
import math
from fractions import gcd
import copy
from itertools import permutations
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7

from itertools import permutations
from math import factorial, hypot





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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a = list(map(int, input().split()))
rec1 = int(a[0]* a[1])
rec2 = int(a[2] * a[3])

if rec1 > rec2:
    result = rec1
elif rec2 > rec1:
    result = rec2
else:
    result = rec1

print(result)

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

Solution (Python):
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)

Solution (Python):

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

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

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

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

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

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

Solution (Python):

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

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

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

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

ab = a * b
cd = c * d

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

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

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

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

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
a_b = a*b
c_d = c*d
if a_b > c_d:
  print(a_b)
else:
  print(c_d)

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

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

Solution (Python):

import sys
input = sys.stdin.readline









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

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

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

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

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

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

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

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

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

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

Solution (Python):
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[2]*a[3])
else:
    print(a[0]*a[1])

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c, d = mi()
    print(max(a*b, c*d))


if __name__ == "__main__":
    main()

Solution (Python):
a, s, d, f = map(int, input().split())
print(max(a*s, d*f))

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

Solution (Python):
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))

tmp = LI()

a,b,c,d = [tmp.pop(0) for i in range(4)]

s1 = a*b
s2 = c*d

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

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

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

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

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

x = a * b
y = c * d

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

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

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

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

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

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

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

Solution (Python):
length=list(map(int,input().split()))
men1 =length[0]*length[1]
men2 =length[2]*length[3]

if men1>=men2:
    print(men1)
else:
    print(men2)

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

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

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

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

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

Solution (Python):
def main():
 num = list(map(int,input().split()))
 if((num[0]*num[1])>(num[2]*num[3])):
  print(num[0]*num[1])
 else:
  print(num[2]*num[3])

main()

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

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

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

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

print(Main(A, B, C, D))

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C,D = inputIL()

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

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

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

Solution (Python):

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

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

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

square1 = a * b
square2 = c * d

ans = 0
if square1 < square2:
    ans = square2
else:
    ans = square1

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

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

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

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

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

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

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

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

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

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

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

Solution (Python):

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):

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

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

if __name__ == '__main__':

    ABC_52_A()

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


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

Solution (Python):

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

    first_rectangle = a * b
    second_rectangle = c * d

    print(max(first_rectangle,second_rectangle))

if __name__ == '__main__':
    main()

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

Solution (Python):


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

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

Solution (Python):
a,b,c,d = map(int,input().split())
A = a*b
B = c*d

if A>=B:
    print(A)
else:
    print(B)

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

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

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

Solution (Python):
a = [int(i) for i in input().split()]
print(max(a[0]*a[1],a[2]*a[3]))

Solution (Python):
import numpy as np
A, B, C, D = map(int, input().split())
S = np.array([A*B, C*D])
print(S.max())

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

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

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

ab = a*b
cd = c*d

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

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

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

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

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

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

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

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

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

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

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

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

rec1 = a * b
rec2 = c * d

if rec1 >= rec2:
  print(rec1)
else:
  print(rec2)

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
a_b = a*b
c_d = c*d
if a_b > c_d:
  print(a_b)
else:
  print(c_d)

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

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

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

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

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

Solution (Python):

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


if '__main__' == __name__:
    resolve()

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

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

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

Solution (Python):
s=input().split()
if int(s[0])*int(s[1])>=int(s[2])*int(s[3]):
  print(int(s[0])*int(s[1]))
else:
  print(int(s[2])*int(s[3]))

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

Solution (Python):

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

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

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

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

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
n=a*b
m=c*d
p=[n,m]
p.sort()
print(p[1])

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()