For this Question: Little Harry has the mighty Sorcerer's Stone in his possession. Professor Quirrell, Harry's teacher, is trying to get hold of the stone. So, he tries to attack him. Both Harry and the Professor attack each other turn by turn. 
You are given an N integers D<sub>1</sub>, D<sub>2</sub>, D<sub>3</sub>,. , D<sub>N</sub>, the damages caused through their attacks in order. Can you let us know who has created more damage to other if the Professor attacks first?

In simple terms, the professor causes D<sub>1</sub> damage to Harry, then Harry causes D<sub>2</sub> damage to the Professor, and so on.The first line of the input contains an integer N, the total number of attacks by Professor and Harry.
The second line of the input contains N integers, the damages caused through the attacks of Professor and Harry.

Constraints
1 <= N <= 100
1 <= D<sub>i</sub> <= 100 for all values of i.Output "Harry" (without quotes) if Harry has created <b>more damage</b>, else output "Professor" (without quotes).Sample Input
4
1 2 3 4

Sample Output
Harry

Explanation
Damage by Professor = 1 + 3 = 4.
Damage by Harry = 2 + 4 = 6.

Sample Input
5
1 2 3 4 5

Sample Output
Professor

Explanation
Damage by Professor = 1 + 3 + 5 = 9
Damage by Harry = 2 + 4 = 6, I have written this Solution Code: def f(a):
    sh=0
    sp=0
    for i in range(len(a)):
        if i%2==1:
            sh+=a[i]
        else:
            sp+=a[i]
    if sh>sp:
        return('Harry')
    else:
        return('Professor')
n=int(input())
a=list(map(int,input().split()))
print(f(a)), In this Programming Language: Python, Now tell me if this Code is compilable or not?