{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eConsider a word \u003ci\u003ew\u003c/i\u003e consisting of \u003ci\u003en\u003c/i\u003e symbols. We can \u003ci\u003edecompose\u003c/i\u003e it at point \u003ci\u003ei\u003c/i\u003e (1 ≤ \u003ci\u003ei\u003c/i\u003e ≤ \u003ci\u003en\u003c/i\u003e − 1) into a prefix \u003ci\u003ep\u003c/i\u003e\r\nof length \u003ci\u003ei\u003c/i\u003e and a suffix \u003ci\u003es\u003c/i\u003e of length \u003ci\u003en\u003c/i\u003e − \u003ci\u003ei\u003c/i\u003e. \u003ci\u003eLocal root\u003c/i\u003e of a word \u003ci\u003ew\u003c/i\u003e at point \u003ci\u003ei\u003c/i\u003e is a non-empty word \u003ci\u003er\u003c/i\u003e such that:\r\n\u003cul\u003e\r\n\u003cli\u003e \u003ci\u003ep\u003c/i\u003e is a suffix of \u003ci\u003er\u003c/i\u003e, or \u003ci\u003er\u003c/i\u003e is a suffix of \u003ci\u003ep\u003c/i\u003e, or \u003ci\u003er\u003c/i\u003e is equal to \u003ci\u003ep\u003c/i\u003e;\r\n\u003c/li\u003e\u003cli\u003e \u003ci\u003es\u003c/i\u003e is a prefix of \u003ci\u003er\u003c/i\u003e, or \u003ci\u003er\u003c/i\u003e is a prefix of \u003ci\u003es\u003c/i\u003e, or \u003ci\u003er\u003c/i\u003e is equal to \u003ci\u003es\u003c/i\u003e;\r\n\u003c/li\u003e\u003cli\u003e \u003ci\u003er\u003c/i\u003e has minimal possible length.\r\n\u003c/li\u003e\u003c/ul\u003e\r\nYour goal is to find such a point that the length of local root at this point is maximal possible.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe only line contains a word \u003ci\u003ew\u003c/i\u003e consisting of lowercase English letters. Its length is at least two and at most 300\u0026nbsp;000 symbols.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the required point of decomposition and the length of local root at this point. If there are several possible answers,\r\noutput any of them.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eaababaaa\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e5 6\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Notes","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eLocal roots of a word “aababaaa” at different points:\r\n\r\n\u003ctable\u003e\u003ctbody\u003e\u003ctr\u003e\r\n\u003ctd width\u003d\"150\"\u003ePoint\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e1\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e2\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e3\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e4\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e5\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e6\u003c/td\u003e\r\n\u003ctd width\u003d\"80\"\u003e7\u003c/td\u003e\r\n\u003c/tr\u003e\u003ctr\u003e\r\n\u003ctd\u003eLocal root\u003c/td\u003e\r\n\u003ctd\u003ea\u003c/td\u003e\r\n\u003ctd\u003ebabaa\u003c/td\u003e\r\n\u003ctd\u003eab\u003c/td\u003e\r\n\u003ctd\u003eba\u003c/td\u003e\r\n\u003ctd\u003eaaabab\u003c/td\u003e\r\n\u003ctd\u003ea\u003c/td\u003e\r\n\u003ctd\u003ea\u003c/td\u003e\r\n\u003c/tr\u003e\u003c/tbody\u003e\u003c/table\u003e\r\n\r\n\u003c/div\u003e\u003c/div\u003e"}}]}