#include <cmath>
class PrimeNumberGenerator {
public:
int num_in;
explicit PrimeNumberGenerator(int start) {
num_in = start;
}
int GetNextPrime() {
// bool prime = false;
bool divided = false;
int out = 0;
// while (!prime) {
for (int j = 2; j <= sqrt(num_in); j++) {
if (num_in % j == 0) {
divided = true;
j = num_in;
}
}
if (!divided) {
prime = true;
out = num_in;
}
num_in++;
// }
return out;
}
};