Q: time complexity

import java.util.Scanner; 
public class madihi {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        System.out.print("enter n = ");        
        int n = scan.nextInt();
        int[] a = new int[n+1];
        int sum1 = 0;
        for(int i = 1 ; i < n ; i++){
            System.out.print("enter number " + i + " = ");
            a[i] = scan.nextInt();
            sum1 = sum1 + a[i];
        }
        System.out.print("enter number " + n + " = ");
        a[n] = scan.nextInt();
        int sum2 = a[n];
        int min = Math.abs(sum1 - sum2);
        for(int i = n-1 ; i > 1 ; i--){
            sum1 = sum1 - a[i];
            sum2 = sum2 + a[i];
            if( Math.abs(sum1 - sum2) < min ){
                min = Math.abs(sum1 - sum2);
            }
        }
        System.out.println("minimum = " + min);
    }
}