Write a Java program to store n numbers in an one dimensional array. Pass this array to a function number(int a[]). Display only those numbers whose sum of digit is prime.

import java.util.Scanner;

public class KboatSDAPrime
{
    public void number(int a[]) {
        
        System.out.println("Numbers whose sum of digit is prime:");
        
        for (int i = 0; i < a.length; i++) {
            int x = a[i];
            int s = 0;
            while (x != 0) {
                int d = x % 10;
                s += d;
                x /= 10;
            }
            
            int c = 0;
            for (int j = 1; j <= s; j++) {
                if (s % j == 0) {
                    c++;
                }
            }
            
            if (c == 2) {
                System.out.println(a[i]);
            }
        }
        
    }
    
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        System.out.print("Enter the number of elements: ");
        int n = in.nextInt();
        int arr[] = new int[n];
        
        System.out.println("Enter array elements: ");
        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }
        
        KboatSDAPrime obj = new KboatSDAPrime();
        obj.number(arr);
    }
}