function solution(n, words) {
let turn = 0;
for(let i = 1; i<words.length; i++){
if(!(words[i][0] === words[i-1][words[i-1].length-1]) || i !== words.indexOf(words[i])) {
turn = i+1;
break; //첫번째 탈락자만 구하면 됨
}
}
if(turn === 0) return [0,0]
let dropout = turn % n === 0 ? n : turn % n
return [dropout, Math.ceil(turn / n)]
}