* Boolean Expressions

(num % 2 == 0)

(num >= 100) && (num <= 1000)

(60 % num == 0)

(num % 13 == 0)

(num >= 1000) && (num <= 9999) && (num % 13 == 0)

(year % 400 == 0) || ((year % 100 != 0) && (year % 4 == 0))


import java.util.*;

public class Test
{
  public static void main (String[] args)
  {
    /*
    // Compute perfect numbers in a range
    Scanner sc = new Scanner (System.in);

    // prompt the user for a range
    System.out.print ("Enter low end: ");
    int lo = sc.nextInt();

    System.out.print ("Enter high end: ");
    int hi = sc.nextInt ();

    for (int n = lo; n <= hi; n++)
    {
      int sumDivisors = 0;
      int limit = n / 2;
      for (int i = 1; i <= limit; i++)
      {
        if (n % i == 0)
	{
          sumDivisors += i;
	}
      }

      if (sumDivisors == n)
      {
        System.out.println (n);
      }
    }
    */

    for (long i = 1000; i <= 9999; i++)
    {
      // check if i is non-palindromic

      long n = i;
      long revNum = 0;
      while (n > 0)
      {
        revNum = revNum * 10 + (n % 10);
	n = n / 10;
      }
       
      if (i != revNum)
      {
        long i3 = i * i * i;
	long revN = 0;
	long i3N = i3;
	while (i3N > 0)
	{
          revN = revN * 10 + (i3N % 10);
	  i3N = i3N / 10;
	}

	if (revN == i3)
	{
          System.out.println (i);
	}

      }
    }
  }
}