diff --git a/Java/primeArray b/Java/primeArray
new file mode 100644
index 0000000..5f4fa6b
--- /dev/null
+++ b/Java/primeArray
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+public class PrimeNumbers{
+public static void main (String[] args){
+    int[] array = new int [5];
+    Scanner in = new Scanner (System.in);
+
+    System.out.println("Enter the elements of the array: ");
+    for(int i=0; i<5; i++)
+    {
+        array[i] = in.nextInt();
+    }
+Elements in the array are looped one by one using for loop.
+    for(int i=0; i<array.length; i++){
+        boolean isPrime = true;
+
+Using for loop and if condition, prime numbers are identified from all the numbers that are entered in the array.
+        for (int j=2; j<i; j++){
+
+            if(i%j==0){
+                isPrime = false;
+                break;
+            }
+        }
+     
+All the prime numbers or the numbers that satisfy the if condition are displayed as output. 
+        if(isPrime)
+
+            System.out.println(i + " are the prime numbers in the array ");
+    }
+}
+}