We find a solution of the optimal stopping problem for the case when a reward function is an integer function of a random walk on an infinite time interval. It is shown that an optimal stopping time is a first crossing time through a level defined as the largest root of Appell's polynomial...