function solution(n, times) {
let answer = 0;
let lt=0;
let rt=1000000000*n;
while(lt<=rt){
let mid=parseInt((lt+rt)/2);
let count=0;
count=times.reduce((val,acc)=>val+parseInt(mid/acc),0);
if (count>=n){
answer=mid;
rt=mid-1;
}else{
lt=mid+1;
}
}
return answer;
}