fork download
  1. # your code goes here
  2. n = int(input())
  3. nums = list(map(int, input().split()))
  4.  
  5.  
  6. def findClosestRefuge(nums):
  7.  
  8. nums.sort()
  9. n = 1
  10. l = len(nums)
  11.  
  12. for i in range(1, l):
  13. if nums[i] != nums[i-1]:
  14. nums[n] = nums[i]
  15. n += 1
  16.  
  17. for i in range(len(nums)):
  18. if nums[i] != i+1:
  19. print(i+1)
  20. break
  21.  
  22. findClosestRefuge(nums)
Success #stdin #stdout 0.03s 9752KB
stdin
13
7 1 4 3 7 6 5 8 6 7 2 6 2
stdout
9