python万圣节派对（函数）

img


题目如上，不知道怎么调整代码了


def y1(n):
    count=0
    t=n[0]
    for i in range(1,len(n)):
        if int(n[i])==t:
            count+=1
            if count>=2:
                return False
        else:
            t=int(n[i])
            count=0
    return n
def y2(n):
    for i in n:
        if -4<int(i)<4:
            return n 
def y3(n):
    for i in n:
        if 0<=int(i)<=6:
            return n
def main():
    N=int(input())
    lst=[]
    for i in range(N):
        s=list(input().split())
        for j in s:
            if y1(j)==y2(j)==y3(j):
                lst.append(j)
                #print(j)
    for i in lst:
        print(i)
main()