For this Question: Mohit has an array of N integers containing all elements from a range he selected, but somehow he lost one element from the array (other the first and the last element).
Given N-1 elements your task is to find the missing one.The first line of input contains a single integer N, the next line contains N-1 space- separated integers.

Constraints:-
1 < = N < = 100000
1 < = elements < = 100000

Note:- It is guaranteed that the maximum element - minimum element is equal to N-1 and all the elements will be different.Print the missing integer.Sample Input:-
3
3 5

Sample Output:-
4

Sample Input:-
5
9 13 12 11

Sample Output:-
10, I have written this Solution Code: N=int(input())

arr_of_int=[None] * (N-1)

arr_of_int=list(map(int, input().split()))

min_elem=min(arr_of_int)
max_elem=max(arr_of_int)

arrsum=0
for i in range(len(arr_of_int)):
    arrsum+=arr_of_int[i]
sum_of_arr=0
i=min_elem
while i<=max_elem:
        sum_of_arr+=i
        i+=1    
print((sum_of_arr-arrsum)), In this Programming Language: Python, Now tell me if this Code is compilable or not?