Find a point in an array of integers in Java, which divides an array into 2 halfs making best asymetry

Asymetry.java

public class Asymetry {
	
	public static int solution(int X, int[] A) {
        	int n = -1;

		int right = A.length - 1;
		int left = 0;
        	int rightCounter = 0;
		int leftCounter = 0;

        	if (A[right] != X) rightCounter++;
        	if (A[left] == X) leftCounter++;

	        while (left != right) { // takes at most O(n) time
	            if (leftCounter > rightCounter) {
	                right--;
	                if (A[right] != X) rightCounter++;
	            } else {
	                left++;
	                if (A[left] == X) leftCounter++;
	            }
	        }

	        if (right > 0) {
	            return right == A.length - 1 ?
	                leftCounter == 0 ? n : right : right;
	        } else return n;
	}

	public static void main(String[] args) {
		System.out.println(solution(5, new int[]{5, 5, 1, 7, 2, 3, 5}));
	}

}