class Hasher():
    def __init__(self, length, base, mod):
        self.length=length
        self.base=base
        self.mod=mod

        self.power=pw=[1]*length
        for i in range(1,length):
            pw[i]=(base*pw[i-1])%mod

    def __repr__(self):
        return "length: {}\nbase: {}\nmod: {}".format(self.length, self.base, self.mod)

    def encode(self, S):
        code=0; N=len(S)
        for i in range(N):
            #code+=ord(S[i])*self.power[N-1-i]%self.mod
            code+=S[i]*self.power[N-1-i]%self.mod

        return code%self.mod

    def decode(self, S):
        pass
#==================================================
def hashing(a,b):
    return a*q+b

#==================================================
from random import randint
import sys
input=sys.stdin.readline
write=sys.stdout.write

N=int(input())

S=[""]*N
L=0
for i in range(N):
    S[i]=[ord(a)-ord("a")+1 for a in input()[:-1]]
    L=max(L,len(S[i]))

p=10**9+7; beta=randint(2,p-1); Hp=Hasher(L, beta, p)
q=10**9+9; gamma=randint(2,q-1); Hq=Hasher(L, gamma, q)

Bp=[1]*L; Bq=[1]*L

for j in range(1,L):
    Bp[j]=Bp[j-1]*beta %p
    Bq[j]=Bq[j-1]*gamma%q

for j in range(L):
    Bp[j]*=beta-1 ; Bp[j]%=p
    Bq[j]*=gamma-1; Bq[j]%=q

E=set()
Ans=["No"]*N
for i in range(N):
    hp=Hp.encode(S[i]); hq=Hq.encode(S[i])

    h=hashing(hp,hq)
    if h in E:
        Ans[i]="Yes"

    for j in range(len(S[i])-1):
        kp=(hp+Bp[len(S[i])-j-2]*(S[i][j+1]-S[i][j]))%p
        kq=(hq+Bq[len(S[i])-j-2]*(S[i][j+1]-S[i][j]))%q

        if hashing(kp,kq) in E:
            Ans[i]="Yes"

    E.add(h)

write("\n".join(Ans))