Problem: A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers.  You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
def main():
    n =int( input())
    sn=[]
    
    for i in range(n):
        inWord = str(input())
        addFlag = True
        for s in sn:
            if s["word"] == inWord and len(sn) !=0:
                s["count"]+=1
                addFlag = False
                break
        if addFlag ==True:
            sn.append( {"word":inWord,"count":1})
    
    a= sorted(sn, reverse=True,key=lambda x:x['count'])

    most = a[0]["count"]
    mostWords=[]
    for elm in a:
        if elm["count"] == most:
            mostWords.append(elm["word"])
    mostWords.sort()
    for elm in mostWords:
        print(elm)
    return
main()



def main():
    n =int( input())
    sn=[]
    for i in range(n):
        
        inWord = str(input())
        addFlag = True
        for s in sn:
            if s["word"] == inWord and len(sn) !=0:
                s["count"]+=1
                addFlag = False
                break
        if addFlag ==True:
            sn.append( {"word":inWord,"count":1})
        
    a= sorted(sn, reverse=True,key=lambda x:x['count'])
    most = a[0]["count"]

    mostWords=[]
    for elm in a:
        if elm["count"] == most:
            mostWords.append(elm["word"])
        
    mostWords.sort()
    for elm in mostWords:
        print(elm)
    return
main()




def main():
    A, B, C = map(int, input().split())
    if A == B:
        if B==C:
            print("No")
        else:
            print('Yes')
    else:
        if B!=C:
            print('No')
        else :
            print("Yes")
main()




def main():
    n =int( input())
    sn=[]
    for i in range(n):
        
        inWord = str(input())
        addFlag = True
        for s in sn:
            if s["word"] == inWord and len(sn) !=0:
                s["count"]+=1
                addFlag = False
                break
        if addFlag ==True:
            sn.append( {"word":inWord,"count":1})
        
    a= sorted(sn, reverse=True,key=lambda x:x['count'])
    most = a[0]["count"]

    mostWords=[]
    for elm in a:
        if elm["count"] == most:
            mostWords.append(elm["word"])
        else :
            break
        
    mostWords.sort()

    for elm in mostWords:
        print(elm)
    return

main()



def main():
    inNum = map(int,input().split())
    A=inNum[0]
    B=inNum[1]
    C=inNum[2]
    if A == B:
        if B==C:
            print('No')
        else:
            print('Yes')
    else:
        print('Yes')

main()


def main():
    A, B, C = map(int, input().split())
    if A == B:
        if B==C:
            print("No")
        else:
            print('Yes')
    else:
        if B==C:
            print('Yes')
        else :
            if C==A:
                print("No")
            else :
                print("Yes")
main()




def main():
    n =int( input())
    sn=[]
    for i in range(n):
        
        inWord = str(input())
        addFlag = True
        for s in sn:
            if s["word"] == inWord and len(sn) !=0:
                s["count"]+=1
                addFlag = False
                break
        if addFlag ==True:
            sn.append( {"word":inWord,"count":1})
        
    a= sorted(sn, reverse=True,key=lambda x:x['count'])
    most = a[0]["count"]

    mostWords=[]
    for elm in a:
        if elm["count"] == most:
            mostWords.append(elm["word"])
    mostWords.sort()

    for elm in mostWords:
        print(elm)
    return

main()




def main():
    n =int( input())
    sn=[]
    for i in range(n):
        
        inWord = str(input())
        addFlag = True
        for s in sn:
            if s["word"] == inWord and len(sn) !=0:
                s["count"]+=1
                addFlag = False
                break
        if addFlag ==True:
            sn.append( {"word":inWord,"count":1})
        
    a= sorted(sn, reverse=True,key=lambda x:x['count'])
    most = a[0]["count"]

    mostWords=[]
    for elm in a:
        if elm["count"] == most:
            mostWords.append(elm["word"])
        else:
            break
        
    mostWords.sort()

    for elm in mostWords:
        print(elm)
    return

main()




def main():
    A, B, C = map(int, input().split())
    if A == B:
        if B==C:
            print("No")
        else:
            print('Yes')
    else:
        if B==C:
            print('Yes')
        else :
            if C==A:
                print("Yes")
            else :
                print("No")
main()



Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted