Special String Identification

You are given a non-empty string s. A string is considered special if and only if it contains at least one substring (of length at least 2) that is a palindrome. A palindrome is a string that reads the same forwards and backwards. Formally, for a substring s[i:j] (with j-i ≥ 2), it is a palindrome if:

\( s[i:j] = \text{reverse}(s[i:j]) \)

Your task is to determine whether the given string is special. Output YES if there exists at least one palindromic substring of length at least 2; otherwise, output NO.

inputFormat

The input consists of a single line containing the string s (1 ≤ |s| ≤ 1000).

outputFormat

Output a single line containing either YES if the string is special, or NO otherwise.

abacab

YES