Time Complexity of the Solution

Could you suggest me time complexity of the following solution:

02.// import java.math.*;

03.class Solution {

04. 

05.int sum = 0;

06.int sumTillCurrentIndex = 0;

07.int sumFromBack = 0;

08.int equi ( int[] A ) {

09.for(int i : A){

10.sum += i;

11.}

12. 

13.if(sum - A[0] == 0 ){

14.return 0;

15.}

16.if((sum - A[A.length -1]) == 0){

17.return(A.length -1);

18.}

19.sumFromBack = sum - A[0];

20.for(int index = 1; index < A.length - 1; index++){

21.sumTillCurrentIndex += A[index - 1];

22.sumFromBack -= A[index];

23.System.out.println("" + sum + ":"

24.+ sumTillCurrentIndex + ":" + sumFromBack );

25.if(sumFromBack == sumTillCurrentIndex){

26.return(index);

27.}

28.}

29.return -1;

30.}

31.}