class PrimeNumberGenerator {
 public:
  int current;
  explicit PrimeNumberGenerator(int start) {
    start == 0 || start == 1 ? current = 2 : current = start;
  }
  int GetNextPrime() {
    while (!isEasya(current)) {
      current++;
    }
    return current++;
  }
  bool isEasya(int n) {
    for (int i = 2; i <= n / 2; i++)
      if (n % i == 0)
        return false;
    return true;
  }
};