bool isOddComposite(long long n, Primes primes){ if(n%2 == 0) return false; if(primes.find(n) != primes.end()) return false; for(long long i = 3; i < n; i+= 2){ if(n%i == 0){ //cout << "base," << n << " divite by " << i << endl; return true; } } return false; }