For this Question: Print the number of reverse pairs in the array given an integer array nums.

A reverse pair is a pair (i, j) where 0 <= i < j < nums.length and nums[i] > 2 * nums[j].The first line of input will be n, which represents the array's length, followed by the n array items in the second line.

Constraints:
0<= n <=10000
1 <= nums[i] <= 10000Print the number of reverse pairs in the array.Sample Input 1:
4
1 3 4 5
Output 1:
0

Sample Input 2:
6
6 5 4 3 2 1
Output 2:
6, I have written this Solution Code: size = int(input())
givenArr = list(map(int,input().split()))
count = 0

for i in range(size):
    for j in range(i+1,size):
        if givenArr[i] > 2*givenArr[j]:
            count += 1
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?