Help me in solving CS2023_STK problem

help
,
1

My issue

Please explain this test-case for this problem

1
7
0 0 0 0 0 0 0
0 0 0 0 0 0 1

Your Output
Om
Expected Output
ADdy

My code

# cook your dish here
T=int(input())
for _ in range(T):
    N=int(input())
    A=list(map(int,input().split()))
    B=list(map(int,input().split()))
    streak1=0
    streak2=0
    for entry1 in A:
        if entry1!=0:
            streak1+=1 
        else:
            streak1=0
    for entry2 in B:
        if entry2!=0:
            streak2+=1 
        else:
            streak2=0
    if streak1>streak2:
        print('Addy')
    elif streak1<streak2:
        print('Om')
    else:
        print('Draw')

Learning course: Arrays using Python
Problem Link: CodeChef: Practical coding for everyone

2

@aaditworks
the maximum length of consecutive 1’s in om are 0 and in addy’s are 1 so the answer would be om.