In javascript please

The task In a 5 by 5 square test plot laid out in the IRL, Professor Smith of the biology department is watching two manatees, Hugh Manatee and Manfred Manatee. They are lazily eating the seagrass and for some reason never stray from the plot. The test plot is laid out in 5x5 grid with (1,1) being the location of the upper-left square, and (5,5) being the location of the lower-right square: (1,1) (1,2) (1,3) (1,4) (1,5) (2,1) (2,2) (2,3) (2,4) (2,5) (3,1) (3,2) (3,3) (3,4) (3,5) (4,1) (4,2) (4,3) (4,4) (4,5) (5,1) (5,2) (5,3) (5,4) (5,5) Every square in this grid is filled with delicious seagrass, except for some barren squares which have no seagrass. Hugh starts grazing in square (1,1), which is always filled with grass, and Manfred starts grazing in square (5,5), which also is always filled with grass. Each half-hour, Hugh and Manfred finish eating all the grass in their respective squares and each move to adjacent grassy squares (north, south, east, or west). They want to consume all the squares with seagrass and end up in exactly the same final location. Please compute the number of different ways this can happen. Hugh and Manfred always move onto grassy squares, and they never both move onto the same square unless that is the very last square with seagrass remaining. Input/Output format Read from the standard input stream one or more lines. The first line is the integer K where 0