from collections import Counter
import sys
input = sys.stdin.readline
n = int(input())
a = [int(i) for i in input().split()]
a.sort(reverse = True)
cnt = Counter(a)
l = []
for i in cnt :
if cnt[i]%2 :
if cnt[i-1]>0 : cnt[i-1]+=1; cnt[i]-=1
else : cnt[i]-=1
if cnt[i]>1 : l.append(i)
l.sort(reverse = True)
ans = 0
for i in range(len(l)-1):
ans+=cnt[l[i]]//4*(l[i]**2)
q = (cnt[l[i]]%4)//2
ans+=(l[i]*l[i+1])*q
cnt[l[i+1]] -= q
if l == [] : print(0)
elif cnt[l[-1]] >= 4 : ans+=cnt[l[-1]]//4*(l[-1]**2) ; print(ans)
else : print(ans)
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |