from collections import defaultdict
n = int(input())
nums = [int(x) for x in input().strip().split()]
idx = defaultdict(list)
for i, x in enumerate(nums):
idx[x].append(i + 1)
nums.sort()
deltas = defaultdict(int)
for i in range(n - 1):
deltas[nums[i+1] - nums[i]] += 1
if len(deltas) == 1:
true_idx = idx[nums[0]][0]
print(true_idx)
exit()
if len(deltas) >= 4:
print(-1)
exit()
if len(deltas) == 2 and deltas[nums[1] - nums[0]] == 1:
true_idx = idx[nums[0]][0]
print(true_idx)
exit()
if len(deltas) == 2 and deltas[nums[n - 1] - nums[n - 2]] == 1:
true_idx = idx[nums[-1]][0]
print(true_idx)
exit()
for i in range(1, n - 1):
d1 = nums[i] - nums[i - 1]
d2 = nums[i + 1] - nums[i]
new_d = d1 + d2
deltas[d1] -= 1
if deltas[d1] == 0:
deltas.pop(d1)
deltas[d2] -= 1
if deltas[d2] == 0:
deltas.pop(d2)
deltas[new_d] += 1
if len(deltas) == 1:
true_idx = idx[nums[i]][0]
print(true_idx)
exit()
deltas[new_d] -= 1
if deltas[new_d] == 0:
deltas.pop(new_d)
deltas[d1] += 1
deltas[d2] += 1
print(-1)
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |