on square low row chessboard stand pawn it variant move upwards leftward upwards rightward the pawn choose square low row start journey on square lie 0 9 pea the pawn wants reach uppermost row having collect pea possible as divide pea k brother number peas divisible k1 find maximal number pea able collect move itthe pawn throw pea away leave board when pawn appear square board include square way necessarily take pea