ss

def solution(nn):
result = [1]
cur = 2
chou = [2,3,5]
while len(result) < nn:
print(cur, result)
if cur in chou:
result.append(cur)
cur += 1
continue

for i in chou:
if int(cur / i) in result:
result.append(cur)
cur += 1
break
return result[-1]