How can I get this traveling salesman problem java code to print correctly ?

package file;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;

/**
 *
 * @author User
 */

    
public class TravelingSalesmanProblem {
    	// there are 17 nodes in example graph (graph is
	// 1-based)

	static int n = 16;
	// give appropriate maximum to avoid overflow

	static int MAX = 1000000;

	// memoization for top down recursion

	
        static int[][] memo = new int[n + 1][1 << (n + 1)];
	static int TSP(int i, int mask, int[][] dist)
	{
            
		// base case
		// if only ith bit and 1st bit is set in our mask,
		// it implies we have visited all other nodes
		// already
		if (mask == ((1 << i) | 3))
			return dist[1][i];
		// memoization
		if (memo[i][mask] != 0)
			return memo[i][mask];

		int res = MAX; // result of this sub-problem

		// we have to travel all nodes j in mask and end the
		// path at ith node so for every node j in mask,
		// recursively calculate cost of travelling all
		// nodes in mask
		// except i and then travel back from node j to node
		// i taking the shortest path take the minimum of
		// all possible j nodes

		for (int j = 1; j <= n; j++)
			if ((mask & (1 << j)) != 0 && j != i && j != 1)
				res = Math.min(res,
							TSP(j, mask & (~(1 << i)),dist)
								+ dist[j][i]);
		return memo[i][mask] = res;
	}

	// Driver program to test above logic


    public static void main(String[] args) throws FileNotFoundException, IOException 
    {
            // all lines in file
            ArrayList<string> lines = new ArrayList();

            BufferedReader in = new BufferedReader(new FileReader("C:\\Users\\User\\Downloads\\testFile.atsp"));

            String line;

            // read lines in file
            while ((line = in.readLine())!=null){
                lines.add(line);
            }

            in.close();
            int size = lines.size();
            // create new 2d array
            int[][] MATRIX = new int[size][];
            boolean first = true;
            // loop through array for each line
            for (int q = 0; q < MATRIX.length; q++)
            {
                // get the rooms by separating by ","
                String[] rooms = lines.get(q).split(",");
                
                if (first) 
                    {
                        first = false;
                        continue;
                    }

                // size 2d array
                MATRIX[q] = new int[rooms.length];

                // loop through and add to array's second dimension
                for (int w = 0; w < rooms.length; w++)
                    {
                        MATRIX[q][w] = Integer.parseInt(rooms[w]);

                    }

                System.out.println(Arrays.toString(MATRIX[q]));
            }

		int ans = MAX;
		for (int i = 1; i <= n; i++)
			// try to go from node 1 visiting all nodes in
			// between to i then return from i taking the
			// shortest route to 1
			ans = Math.min(ans, TSP(i, (1 << (n + 1)) - 1,MATRIX)
									+ MATRIX[i][1]);

		System.out.println(
			"The cost of most efficient tour = " + ans);
	}
}