Given an array, A, of length N. Find the absolute difference between the smallest and largest prime number in array A.

Input:
First line contains an integer, N, number of points.
Second line contains N space separated integers, \(A_i\), denoting the elements of the array A.

Output:
Print the absolute difference between the smallest and largest prime number in array A, otherwise 1.

Constraints:
\(1 \le N \le 10^6\)
\(1 \le A_i \le 10^6\)