P26424 [AtCoder] Niconico String Determination
普及
题目描述

Problem Description

Niwango, an employee of dwango, found a string $s$ consisting of only digits with a length of $4$. If $s$ is a Niconico string (described below), output Yes; otherwise, output No.

A string $s$ is called a Niconico string if there exist digits $x$ and $y$ such that $s$ can be represented as xyxy. For example, 2525, 4141, and 9999 are Niconico strings, but 2255, 1221, and 3334 are not.

Input Format

The input is given from the standard input in the following format:

$ s $

Output Format

Output the answer.

Sample Input and Output

Sample Input #1

2525

Sample Output #1

Yes

Sample Input #2

1881

Sample Output #2

No

Notes/Hints

Constraints

  • $ |s| = 4 $
  • $ s $ consists of only digits

Sample Explanation 1

  • This is as described in the problem statement.
输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
2525
样例输出
Yes