For this Question: Given an integer array A of size N. Find whether there exist two index i and j such that i != j and A[i] = 2 * A[j].First line contains an integer N.
Next line contains N space separated integers denoting elements of array.

Constraints
1 <= N <= 10^5
1 <= Ai <= 10^5Print "YES" if there exist two index i and j which fulfil the above constraints. Otherwise print "NO".Sample Input 1:
4
10 2 5 3

Output 
YES

Explanation:
Both 5 and 10 are present in the array.

Sample Input 2:
4
7 1 13 11

Output 
NO

Explanation:
There does not exist and two indexes such that A[i] = 2 * A[j], I have written this Solution Code: def checkIfExist(List):
    hashMap = {}
    for i in List:
        if(hashMap.get(i+i)):
            return "YES"
        if(i%2 == 0 and hashMap.get(i//2)):
            return "YES"
        hashMap[i] = "YES"
    return "NO"
N=int(input())
List=list(map(int,input().split()))
print(checkIfExist(List)), In this Programming Language: Python, Now tell me if this Code is compilable or not?