Merge sort- 1/2

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner Input = new Scanner(System.in);
        System.out.println("Input number of elements:");
        int N = Input.nextInt();
        int[] arr = new int[N];
        for (int i = 0; i < N; i++) {
            System.out.println("Please input the ["+i+"] element : ");
            arr[i] = Integer.parseInt(Input.nextLine());
        }
        System.out.println();
        System.out.println("BEFORE MERGE-SORT" + Arrays.toString(arr));

        Sort(arr,0, arr.length-1);
        System.out.println();
        System.out.println("AFTER MERGE-SORT" + Arrays.toString(arr));


    }
    }