吉林大学ACM集训队选拔赛 B Subset of Five【返回非零解】

n = int(input())
nums = list(map(int, input().split()))
nums.sort()
sum_ = 0
nums2 = [0] * n
for i in range(n):
    sum_ += nums[i]
    nums2[i] = nums[i] % 5
# print(nums2)
# print('sum_', sum_)
yu = sum_ % 5
# print(yu)
if yu == 0:
    print(sum_)
elif yu == 1:
    print(sum_ - nums[nums2.index(1)])
elif yu == 2:
    min_ = 10e9
    k1 = nums2.index(1)
    nums2[nums2.index(1)] = 0
    k2 = nums2.index(1)
    min_ = min(min_, nums[k1] + nums[k2])
    min_ = min(min_, nums[nums2.index(2)])
    print(sum_ - min_)
elif yu == 3:
    min_ = 10e9
    k1 = nums2.index(1)
    nums2[nums2.index(1)] = 0
    k2 = nums2.index(1)
    nums2[k2] = 0
    k3 = nums2.index(1)
    min_ = min(min_, nums[k1] + nums[k2] + nums[k3])
    s2 = nums2.index(2)
    min_ = min(min_, nums[k1] + nums[s2])
    min_ = min(min_, nums[nums2.index(3)])
    print(sum_ - min_)
elif yu == 4:
    min_ = 10e9
    k1 = nums2.index(1)
    nums2[nums2.index(1)] = 0
    k2 = nums2.index(1)
    nums2[k2] = 0
    k3 = nums2.index(1)
    nums2[k3] = 0
    k4 = nums2.index(1)
    min_ = min(min_, nums[k1] + nums[k2] + nums[k3] + nums[k4])
    s2 = nums2.index(2)
    nums2[s2] = 0
    min_ = min(min_, nums[k1] + nums[k2] + nums[s2])
    s1 = nums2.index(2)
    min_ = min(min_, nums[s1] + nums[s2])
    r1 = nums2.index(3)
    min_ = min(min_, nums[k1] + nums[r1])
    min_ = min(min_, nums[nums2.index(4)])
    print(sum_ - min_)