Recursive 2D Array Traversal

What is the output produced by the following program?

public class EvenSum {
    public static int sumEven(int[][] arr, int i, int j) {
        if (i == arr.length) return 0;
        if (j == arr[i].length) return sumEven(arr, i + 1, 0);
        int add = (arr[i][j] % 2 == 0) ? arr[i][j] : 0;
        return add + sumEven(arr, i, j + 1);
    }
    public static void main(String[] args) {
        int[][] matrix = { {1, 2, 3}, {4, 5, 6} };
        System.out.println(sumEven(matrix, 0, 0));
    }
}