{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n \u003cp\u003eYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For example for string \u0027ababa\u0027 F(3) will be 2 because there is a string \u0027aba\u0027 that occurs twice. Your task is to output F(i) for every i so that 1\u0026lt;\u003di\u0026lt;\u003d|S|.\u003c/p\u003e\n \u003ch3\u003eInput\u003c/h3\u003e\n \u003cp\u003eString S consists of at most 250000 lowercase latin letters.\u003c/p\u003e\n \u003ch3\u003eOutput\u003c/h3\u003e\n \u003cp\u003eOutput |S| lines. On the i-th line output F(i).\u003c/p\u003e\n \u003ch3\u003eExample\u003c/h3\u003e\n \u003cpre\u003e\u003cstrong\u003eInput:\u003c/strong\u003e\u003cbr\u003eababa\u003cbr\u003e\u003cbr\u003e\u003cstrong\u003eOutput:\u003c/strong\u003e\u003cbr\u003e3\u003cbr\u003e2\u003cbr\u003e2\u003cbr\u003e1\u003cbr\u003e1\u003cbr\u003e\u003c/pre\u003e\n\u003c/div\u003e"}}]}