{"raw_statement":[{"iden":"statement","content":"You consider a string to be a _diverse string_ if every pair of adjacent characters are different. For example _coderams_ is a diverse string, while _hello_ is not.\n\nGiven a string, figure out whether or not it is a diverse string.\n\nThe only line of input contains a single string, not containing spaces.\n\nIf the string is a diverse string, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes).\n\n"},{"iden":"input","content":"The only line of input contains a single string, not containing spaces."},{"iden":"output","content":"If the string is a diverse string, output \"YES\" (no quotes). Otherwise, output \"NO\" (no quotes)."},{"iden":"examples","content":"Inputcoderamsclub\nOutputYES\nInputhelloworld\nOutputNO\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ s = s_1 s_2 \\dots s_n $ be a string of length $ n \\geq 1 $, where each $ s_i $ is a character.\n\n**Constraints**  \n$ n \\geq 1 $, and $ s_i \\in \\Sigma $ for some alphabet $ \\Sigma $, with no spaces in $ s $.\n\n**Objective**  \nDetermine whether $ s $ is a *diverse string*, i.e.,  \n$$\n\\forall i \\in \\{1, 2, \\dots, n-1\\}, \\quad s_i \\neq s_{i+1}\n$$  \nIf true, output \"YES\"; otherwise, output \"NO\".","simple_statement":"Check if a string has no two adjacent characters the same. If yes, print \"YES\", otherwise print \"NO\".","has_page_source":false}