


def solution(n, words):
answer = []
check=[]
last=''
cnt=0
for i in range(0, len(words), n):
cnt+=1
for j in range(n):
if i==0 and j==0:
word=words[i+j]
last=word[-1]
check.append(word)
elif words[i+j] not in check and last==words[i+j][0]:
word=words[i+j]
last=word[-1]
check.append(word)
else:
answer.append(j+1)
answer.append(cnt)
break
if answer!=[]:
break
if answer==[]:
answer.append(0)
answer.append(0)
return answer