#include <set>
#include <sstream>

using namespace std;

constexpr int evil = 46708;

volatile bool rd = 1, ins = 1;
volatile int q = 575;

void postinsert() {
  stringstream ss{"1"};
  set<int64_t> s;
  // 0-2: q < 2
  // 3:   q < 5
  // 4:   q < 2
  // 5:   q < 3 || q == 5
  // 6:   q < 2 || q == 3
  // 7:   q < 3 || q == 4 || q == 8
  // 8:   q < 2 || q == 7
  // 9:   q < 4 || q == 6
  // 14:  q < 2
  // 15:  q <= 20, {30, 40, 50, 64, 70, 100, 110, 120, 130, .., 270, 280, 281, 287, 238} (q < 288?)
  // higher pre-fill counts don't seem to invoke slowdown
  for (int i = 0; i < 31; ++i) {
    s.insert(~i);
  }
  for (int i = 0; i < 100000; ++i) {
    ss.seekg(0);
    if (rd) {
      int t;
      ss >> t;
    }
    if (ins) {
      for (int j = 0; j < q && s.size() < evil; ++j) {
        s.insert(i * q + j);
      }
    }
  }
}

void preinsert() {
  stringstream ss{"1"};
  set<int64_t> s;
  // q = {1, 3, 5, 15}, nothing more up to 34
  for (int i = 0; i < 100000; ++i) {
    ss.seekg(0);
    if (rd) {
      int t;
      ss >> t;
    }
    if (ins) {
      for (int j = 0; j < q && s.size() < evil; ++j) {
        s.insert(i * q + j);
      }
    }
  }
}

void readmore() {
  stringstream ss{"1"};
  set<int64_t> s;
  // q = 1..7 slow, 8 fast
  // 9..16 slow, 17 fast
  // 18..24 slow, 32..34 slow, 35 fast
  // 71, 143, 287, 575, (2^(k+3)+2^k-1?) fast
  for (int i = 0; i < 100000; ++i) {
    if (rd) {
      for (int j = 0; j < q; ++j) {
        ss.seekg(0);
        int t;
        ss >> t;
      }
    }
    if (ins) {
      if (s.size() < evil) {
        s.insert(i);
      }
    }
  }
}

int main() {
  readmore();
  return 0;
}