#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 i = 2; i <= sqrt(num_in); i++) {
if (num_in % i == 0) {
divided = true;
i = num_in;
}
}
if (!divided) {
prime = true;
out = num_in;
}
num_in++;
}
return out;
}
}