Dividing array to even and odd(bublle and insertion sort)

package com.company;

import java.util.Arrays;
import java.util.Scanner;

public class BublleAndInsertionSort {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = Integer.parseInt(scan.nextLine());
        int[] arr1 = new int[n];

        int evenIndex = 0;
        int oddIndex = 0;
        int evenCount = 0;
        int oddCount = 0;
        for (int i = 0; i < n; i++) {
            System.out.printf("Please insert the [%d] element of array :", i);
            arr1[i] = Integer.parseInt(scan.nextLine());

            if (arr1[i] % 2 == 0) {

                evenCount++;
            } else {

                oddCount++;
            }
        }
        int[] oddArr = new int[oddCount];
        int[] evenArr = new int[evenCount];

        for (int i = 0; i < n; i++) {
            if (arr1[i] % 2 == 0) {
                evenArr[evenIndex] = arr1[i];
                evenIndex++;
            } else {
                oddArr[oddIndex] = arr1[i];
                oddIndex++;
            }
        }

        System.out.println("BEFORE SORTING OF EVEN ARRAY :");
        System.out.println(Arrays.toString(evenArr));
        System.out.println("BEFORE SORTING OF ODD ARRAY :");
        System.out.println(Arrays.toString(oddArr));
        bublleSort(evenArr);
        insertionSort(oddArr);
        System.out.println("AFTER SORTING OF EVEN ARRAY :");
        System.out.println(Arrays.toString(evenArr));
        System.out.println("AFTER SORTING OF ODD ARRAY :");
        System.out.println(Arrays.toString(oddArr));
    }


    private static void bublleSort(int[] evenArr) {
        int free;
        for (int i = 0; i < evenArr.length - 1; i++) {
            for (int j = 0; j < evenArr.length - 1 - i; j++) {
                if (evenArr[j] > evenArr[j + 1]) {
                    free = evenArr[j];
                    evenArr[j] = evenArr[j + 1];
                    evenArr[j + 1] = free;
                }
            }
        }
    }

    private static void insertionSort(int[] oddArr) {
        int n = oddArr.length;
        for (int j = 1; j < n; j++) {
            int key = oddArr[j];
            int i = j - 1;
            while ((i > -1) && (oddArr[i] > key)) {
                oddArr[i + 1] = oddArr[i];
                i--;
            }
            oddArr[i + 1] = key;
        }
    }
}