#include <string>
#include <vector>
#include <map>
#include <math.h>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <sstream>
#include <algorithm>
using namespace std;
long long solution(int n, vector<int> times) {
long long answer = 0;
long long temp = 1000000000;
long long right = temp * n;
long long left = 1;
long long len = times.size();
long long result = right;
while (left <= right) {
long long sum = 0;
long long mid = (right + left) / 2;
for (long long i = 0; i < len; i++) {
sum += mid / times[i];
}
if (sum >= n) {
right = mid - 1;
result = min(result, mid);
}
else {
left = mid + 1;
}
}
answer = result;
return answer;
}