I write the code as my knowledge but i didnt get the correct ouput.i provide my code below

#include <stdio.h>

int main() {
    int i, j, isPrime, n, a[1000], k;

    // Input array limit
    printf("Enter array limit: ");
    scanf("%d", &n);

    // Input array elements
    printf("Enter array elements:n");
    for(i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }

    // Loop through the array
    for(i = 0; i < n;  i++;) {
        // Check if current element is prime
        if (a[i] < 2) {
            isPrime = 0; // Numbers less than 2 are not prime
        } else {
            isPrime = 1; // Assume the number is prime
            for (j = 2; j * j <= a[i]; j++) {
                if (a[i] % j == 0) {
                    isPrime = 0; // Found a divisor, not a prime number
                    break;
                }
            }
        }

        // Print the current number based on prime status
        if (isPrime) {
            printf("%d ", a[i]);
        } else {
            printf("%d ", a[i]);
            // Skip the next two elements by shifting the array
            for (k = i + 1; k < n - 2; k++) {
                a[k] = a[k + 2];
            }
            n -= 2; // Reduce array size by 2
            i--; // Recheck the current position
        }
      
    }

    return 0;
}

when i run this code i didnt get the correct output.
eg:-
if I enter array limit 9 and print 1-9 i got the output as 1 1 1 1 1 .
Can u please help me to solve this problem

I want a solution for my problem.