For this Question: You have been given a sequence A of N digits. Each digit in this sequence ranges from 1 to 10^9. You need to perform 2 types of operations on this list:

Add(x): Add element x to the end of the list.
Max(list): Find the maximum element in the current sequence.
For each query of type 2, you need to print the result of that operation.The first line consists of a single integer N denoting the size of the initial sequence. The next line consists of N space-separated integers denoting the elements of the initial sequence. The next line contains a single integer q denoting the number of queries. The next q lines contain the details of the operation. The first integer type indicates the type of query. If typei ==1, it is followed by another integer x and you need to perform an operation of type 1 else operations of type 2

Constraints
1 < = N < = 10^5
1 < = Ai < = 10^9
1 < = q < = 10^4For each operation of the second type, print a single integer on a new line.Sample Input
5
1 2 3 4 5
6
1 1
1 2
1 3
2
1 8
2

Sample Output
5
8, I have written this Solution Code: a=int(input())
lis=list(map(int,input().split()))
mNow = max(lis)
qr=int(input())
for _ in range(qr):
    inp = list(map(int,input().split()))
    if(inp[0]==1):
        if(inp[1]>mNow):
            lis.append(inp[1])
            mNow = inp[1]
    else:
        print(mNow), In this Programming Language: Python, Now tell me if this Code is compilable or not?