#include "newH2.h"

long long n=0;
int main(/*int argc, char* argv[]*/) {
 //MPI_Init(&argc, &argv);
 for(n=1032001; n<1038000; n+=2){ //put in bounds here on your prime search
   if(isPrime(n)/* && isPrime((n-1)/2)*/){ //uncomment this section
if you want
     run();                                // to do a safe-prime search
   }
 }
 //MPI_Finalize();
 return 0;
}