Help me in solving SNELECTP problem

help
,
1

My issue

inp=int(input())

for var in range(inp):
s=input()
n=len(s)
sna=mon=0
for i in range(n):
if s[i]==‘m’:
mon=mon+1
elif s[i]==‘s’:
sna=sna+1
else:
print(“invalid”)

if (sna==mon or mon>sna):
    print("mongooses")
elif(sna==mon+1):
    print("tie")
elif(sna>mon):
    print("snakes")
else:
    print("tie")

why is this code a wrong answer

My code

# cook your dish here
inp=int(input())

for var in range(inp):
    s=input()
    n=len(s)
    sna=mon=0
    for i in range(n):
        if s[i]=='m':
           mon=mon+1
        elif s[i]=='s':
           sna=sna+1
        else:
            print("invalid")

    if (sna==mon or mon>sna):
        print("mongooses")
    elif(sna==mon+1):
        print("tie")
    elif(sna>mon):
        print("snakes")
    else:
        print("tie")

Learning course: Greedy Algorithms
Problem Link: Snakes, Mongooses and the Ultimate Election Practice Problem in Greedy Algorithms - CodeChef