class Solution {
    public int solution(int[][] sizes) {
        int maxLength = 0;
        int minLength = 0;

        for (int i = 0; i < sizes.length; i++) {
            int[] nameCard = sizes[i];

            int horizontal = nameCard[0];
            int verical = nameCard[1];

            if (horizontal >= verical) {
                maxLength = maxLength == 0 ? horizontal : Math.max(maxLength, horizontal);
                minLength = minLength == 0 ? verical : Math.max(minLength, verical);
            } else {
                maxLength = maxLength == 0 ? verical : Math.max(maxLength, verical);
                minLength = minLength == 0 ? horizontal : Math.max(minLength, horizontal);
            }
        }

        return maxLength * minLength;
    }
}