Prime Number Check

/* Write an expression that checks if given positive integer number n (n ≤ 100) is prime
 * (i.e. it is divisible without remainder only to itself and 1). */

import java.util.Scanner;

public class CheckGivenPositiveIntegerIsPrime {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        System.out.print("Enter a Integer number in the range [0 .. 100] : ");
        Scanner input = new Scanner(System.in);
        int number = input.nextInt();
        input.close();

        if (number > -1 && number < 101) {
            boolean numIsPrime = (number == 2 || number == 3 || number == 5 || number == 7)
                    || (number != 1 && number % 2 != 0 && number % 3 != 0 && number % 5 != 0 && number % 7 != 0);

            System.out.printf("That Number is Prime: %b !\n", numIsPrime);
        } else {
            System.out.println("Error! - Your Number is out of Range!!!");
        }
    }

}