#include <set>
#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream>

int main(char **argv, int argc) {
  vector<int> s1;
  vector<int> s2;
  vector<int> s3;

  s1.reserve(100000);
  s2.reserve(100000);
  s3.reserve(100000);

  int i;
  for (i=0; i<100000; ++i) {
    s1.push_back(i * 514 % 999999);
    s2.push_back(i * 752 % 999997);
  }
  cout << '.' << "\n";
  sort(s1.begin(), s1.end());
  sort(s2.begin(), s2.end());
  cout << '.' << "\n";

  int j;
  for (j=0; j<100; ++j) {
    set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(s3, s3.end()));
    cout << '.' << "\n";
  }

  cout << s3.size();
}