Help me in solving CS2023_STK problem

help
,
1

My issue

Please help, why isn’t my code working? It says WA. My approach is to split the array by 0, sort all subarrays by size and then return addy if addy’s biggest subarray is bigger than om’s, and vice versa.

My code

for i in range(int(input())):
    input()
    om = input().split("0")
    abby = input().split("0")
    
    om = [om[i].split() for i in range(len(om))]
    abby = [abby[i].split() for i in range(len(abby))]    
    
    om = sorted(om, key = len, reverse = True)
    abby = sorted(abby, key = len, reverse = True)
    
    
    if len(om[0]) > len(abby[0]):
        print("Om")
    elif len(om[0]) < len(abby[0]):
        print("Addy")
    else:print("Draw")

Problem Link: CS2023_STK Problem - CodeChef