from math import gcd
class UserMainCode(object):
    @classmethod
    def SumOfArray(cls, input1, input2):
        N = input1
        A = input2
        
        max_so_far = A[0]
        for i in range(1, N):
            max_so_far = max(max_so_far, A[i])
            A[i] = gcd(A[i], max_so_far)
        
        A.sort()
        
        sum_B = 0
        for i in range(N // 2):
            sum_B += gcd(A[i], A[N - 1 - i])
        
        return sum_B

class UserMainCode(object):
    @classmethod
    def theLastChocolate(cls, input1, input2):
        dp = [[0] * (input1 + 1) for _ in range(input1 + 1)]
        dp[1][1] = 1
        
        for i in range(2, input1 + 1):
            for j in range(1, i + 1):
                dp[i][j] += dp[i - 1][j - 1] if j - 1 >= 1 else 0
                dp[i][j] += dp[i - 1][j] if j <= i - 1 else 0
        
        return dp[input1][input2].