def knapsap_mod(nums, mod):
    numbers = [num % mod for num in nums]
    dp = [[0 for i in range(mod)] for _ in range(len(numbers) + 1)]
    dp[0][0] = 1

    for i in range(len(numbers)):
        for j in range(mod):
            if dp[i][j] == 1:
                dp[i + 1][(j + numbers[i]) % mod] = 1
                dp[i + 1][(j + mod - numbers[i]) % mod] = 1

    # print(dp[len(numbers)][0])

    if dp[len(numbers)][0] == 1:
        result = []
        n = len(numbers)
        cur = 0
        while n > 0:
            left = (cur + (mod - numbers[n - 1])) % mod
            right = (cur + numbers[n - 1]) % mod
            if dp[n - 1][left] == 1:
                cur = left
            else:
                cur = right
                result.append(n - 1)
            n -= 1

        return result





def __main__():
    n = int(input())
    numbers = list(map(int, input().split()))

    answer = []
    for mod in range(1001, 2001):
        result = knapsap_mod(numbers, mod)
        # print(result, sum([numbers[i] for i in result]) % mod)
        if sum([numbers[i] for i in result]) == 1000000000:
            answer = result
            break

        # print(num_at_least_k)

    print(answer)

__main__()