static public int getSolution() throws IOException {
		int[][] grid = getGrid();
		Stack<Integer> stack = new Stack<>();
		int cur_i = SIZE - 1, cur_j = SIZE - 1;
		stack.push(grid[cur_i][cur_j]);
		for (int i = SIZE - 1; i >= 0; i--) {
			for (int j = SIZE - 1; j >= 0; j--) {
				int sumRight = -1;
				int sumDown = -1;
				if (j <= SIZE - 2) {
					sumRight = grid[i][j] + grid[i][j + 1];
				}
				if (i <= SIZE - 2) {
					sumDown = grid[i][j] + grid[i+1][j];;
				}
				if(sumDown == -1 && sumRight==-1){
					grid[i][j] = grid[i][j];
				}
				else if(sumDown == -1){
					grid[i][j] = sumRight; 
				}
				else if(sumRight == -1){
					grid[i][j] = sumDown;
				}
				else{
					if(sumRight > sumDown) grid[i][j] = sumDown;
					else grid[i][j] = sumRight;
				}
			}
		}
		return grid[0][0];
	}