/******************************************************************************
 *  Compilation:  javac RandomWalkers.java
 *  Execution:    java RandomWalker n
 *
 *  Simulates how long it takes n random walkers starting at the center
 *  of an n-by-n grid to visit every cell in the grid.
 *
 ******************************************************************************/

public class RandomWalkers {

    public static void main(String[] args) {
        int n = Integer.parseInt(args[0]);
        int[] x = new int[n];         // x positions
        int[] y = new int[n];         // y positions
        int cellsToVisit = n*n;       // cells left to visit
        int steps = 0;                // number of steps taken
        double r;
        boolean[][] visited = new boolean[n][n];  // has the i-j been visited?

        // start at center
        for (int i = 0; i < n; i++) {
            x[i] = n/2;
            y[i] = n/2;
        }
        visited[n/2][n/2] = true;
        cellsToVisit--;


        // repeat until all cells have been visited
        while (cellsToVisit > 0) {
            steps++;

            // move random walker i
            for (int i = 0; i < n; i++) {
                r = Math.random();
                if      (r <= 0.25) x[i]++;
                else if (r <= 0.50) x[i]--;
                else if (r <= 0.75) y[i]++;
                else if (r <= 1.00) y[i]--;

                // check if (x[i], y[i]) is inside N-by-N boundary and has been visited
                if (x[i] < n && y[i] < n && x[i] >= 0 && y[i] >= 0 && !visited[x[i]][y[i]]) {
                    cellsToVisit--;
                    visited[x[i]][y[i]] = true;
                }
            }
        }

        System.out.println(steps);
    }

}