)(Public static void main

Int A1 = isJeffian(new int [ ] {7, 4, 11, 6, 13, 11, 17, 8, 10, 13, 7})

Int A2 = isJeffian(new int [ ] {3, 7, 7, 6, 7})

Int A3 = isJeffian(new int [ ] {8, 4, 6, 9})

Int A4 = isJeffian(new int [ ] {3, 2, 2, 2})

Int A5 = isJeffian(new int [ ] {3, 3, 3})

Int A6 = isJeffian(new int [ ] {-3, 0, 4})

static int isPrime(long n)

;boolean prime = true

for (long i = 3; i <= Math.sqrt(n); i += 2)

{ if (n % i == 0)

;prime = false

;break

{ if (( n%2 !=0 && prime && n > 2) || n == 2 (

;return 1

{ else }

;return 0

{Static int isJeffian(int[] a)

;][Int[] primes= new int

For (int I=0;i<=a.length; i++)

{
If (isprime(a[i])==1)

;Primes[i]=a[i]

; double min = primes[0]

for ( int k=0; k<primes.length; k++ )
{
;if ( A[k] < min ) min = A[k]
}

if (primes.length ==min)

;Return 1

{ Else

}Return 0