int _tmain(int argc, _TCHAR* argv[])
{

	int num=2;
	int NumOfPrimes;
	

	for(NumOfPrimes=0; NumOfPrimes<100; num++)
	{
		int backwards= reverse(num);

		if (num %(num/2)!= 0 && num % (num/3)!= 0 && num % (num/5)!= 0)
			{

				if (backwards % (backwards/2)!= 0 && backwards % (backwards/3)!= 0 && backwards % (backwards/5)!= 0)
				{
				cout<<"  "<<num;
				NumOfPrimes++;
				}
			}
	}

	return 0;
}

int reverse( int n )
{
    int result = 0;

	//Accounts for negative numbers

	bool isNegative = false;
    if( n < 0 )
    {
        isNegative = true;
        n = -n;
    }

	//Reverses number

    while( n > 0 )
    {
        result *= 10;
        result += n % 10;
        n /= 10;
    }

	if( isNegative)
    {
        result = -result;
    }

    return result;
}

int is_prime(int n) /*'input' is passed to function as 'n'*/
{
	int k, limit;

	int backwards= reverse(n);
	
	if (n==2) /*if 'input' = 2, then it's prime and 'true' is returned*/
		return 1;
	if (n%2==0 && backwards%2==0) /*if 'input' is evenly divisible by 2, then it's not prime and 'false' is returned*/
		return 0;
	limit = n/2;
	int limit2 = backwards/2;

	
	for (k=3; k <= limit; k += 2) /*checks to see if 'input' is evenly divided by an odd #*/
		if (n%k==0)
			return 0;
	for (k=3; k <= limit2; k += 2)
		if (backwards%k==0)
			return 0;
	return 1;
	
}

int main()
{
	int input, i=0;
	int NumOfPrimes=0;
	
	for (input = 0; i <= 100; ++input)
		if (is_prime(input)==1){     /*if a prime is found, increment a counter then print the counter and the prime number*/
			++i;
			cout<<setw(7)<<input<<" ";
			if (i==10 && i==20 && i==30 && i==40 && i==50 && i==60 && i==70 && i==80 && i==90)
				cout<<endl;
		}
	return 0;
}