Deret Bilangan Prima - fastest

import java.util.Scanner;

/**
 *
 * @author hendri
 */
public class Prima_V2_deret {
    public static void main(String[] args) {
        Boolean p = true;
        int N, r, n=0;
        Scanner sc = new Scanner(System.in);
        System.out.println("Masukkan batas bilangan : ");
        try {
            N = sc.nextInt();
            System.out.println("Deret Bilangan prima hingga "+N+": ");
            for(n=2; n<=N;n++) {
                p = true;
                for (r = 2; r<=n/2;r++) {
                    if (n % r == 0) {
                        p = false;
                        break;
                    }
                }
                if (p) System.out.println(n);
            }
        } catch (Exception e) {
            System.out.println("Kesalahan input !!");
        }
    }
}