{"problem":{"name":"K. Palindromization","description":{"content":"Mihahim has a string s. He wants to delete exactly one character from it so that the resulting string would be a palindrome. Determine if he can do it, and if he can, what character should be deleted.","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10097K"},"statements":[{"statement_type":"Markdown","content":"Mihahim has a string s. He wants to delete exactly one character from it so that the resulting string would be a palindrome. Determine if he can do it, and if he can, what character should be deleted.\n\nThe input contains a string s of length (2 ≤ |s| ≤ 200000), consisting of lowercase Latin letters.\n\nIf the solution exists, output «_YES_» (without quotes) in the first line. Then in the second line output a single integer x — the number of the character that should be removed from s so that the resulting string would be a palindrome. The characters in the string are numbered from 1. If there are several possible solutions, output any of them.\n\nIf the solution doesn't exist, output «_NO_» (without quotes).\n\n## Input\n\nThe input contains a string s of length (2 ≤ |s| ≤ 200000), consisting of lowercase Latin letters.\n\n## Output\n\nIf the solution exists, output «_YES_» (without quotes) in the first line. Then in the second line output a single integer x — the number of the character that should be removed from s so that the resulting string would be a palindrome. The characters in the string are numbered from 1. If there are several possible solutions, output any of them.If the solution doesn't exist, output «_NO_» (without quotes).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ s \\in \\Sigma^* $ be a string of length $ n $, where $ \\Sigma = \\{a, b, \\dots, z\\} $, and $ 2 \\leq n \\leq 200000 $.  \n\n**Constraints**  \n1. $ |s| = n $  \n2. $ s_i \\in \\Sigma $ for all $ i \\in \\{1, \\dots, n\\} $  \n\n**Objective**  \nDetermine if there exists an index $ x \\in \\{1, \\dots, n\\} $ such that the string $ s' = s_1 s_2 \\dots s_{x-1} s_{x+1} \\dots s_n $ is a palindrome.  \n\nIf such $ x $ exists, output:  \n- First line: \"YES\"  \n- Second line: $ x $  \n\nOtherwise, output:  \n- \"NO\"","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10097K","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}