#include <cmath>

using std::sqrt;

class PrimeNumberGenerator {
 private:
  int current_number;

 public:
  explicit PrimeNumberGenerator(int start) {
    current_number = start;
    if (current_number == 1) {
      current_number = 2;
    }
  }
  int GetNextPrime() {
    int i;
    for (i = current_number;; i++) {
      bool flag = true;
      for (int j = 2; j <= sqrt(i); j++) {
        if (i / j * j == i) {
          flag = false;
        }
      }
      if (flag) {
        current_number = i + 1;
        return i;
      }
    }
  }
};