Happy String

Given a string s, determine whether it is a happy string. A string is considered happy if it does not contain two identical adjacent characters. Formally, a string s of length n is happy if for every index \(i\) with \(1 \leq i < n\), the condition \(s[i] \neq s[i-1]\) holds. An empty string is also considered happy.

inputFormat

The input consists of a single line containing the string \(s\). The string may be empty.

outputFormat

Output a single line: True if the string is happy, or False otherwise.

True