C. Fibonacci Words-April Fools Day Contest 2021

Problem - 1505C - Codeforces

C. Fibonacci Words

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Input

The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.

Output

Output "YES" or "NO".

Examples

input

Copy

HELP

output

Copy

YES

input

Copy

AID

output

Copy

NO

input

Copy

MARY

output

Copy

NO

input

Copy

ANNA

output

Copy

YES

input

Copy

MUG

output

Copy

YES

input

Copy

CUP

output

Copy

NO

input

Copy

SUM

output

Copy

YES

input

Copy

PRODUCT

output

Copy

NO

==============================================================================

Fools save water , It is worth noting that , Once the two letters exceed 26 This limit , that ascll Will not be able to represent this letter , So we associate it with taking a mold , Judge whether the sum of the modules is equal

#include<iostream>
using namespace std;



int main()
{


    string s;

    cin>>s;


    int flag=0;

    int pre1=0,pre2=0;

    pre1=s[0]-'A';

    pre2=s[1]-'A';

    for(int i=2;i<s.length();i++)
    {
        int now=s[i]-'A';

        if((pre1+pre2)%26!=now)
        {
            flag=1;

            break;

        }

        pre1=pre2;

        pre2=now;


    }


  if(flag)
  {
      cout<<"no";

  }
  else
    {cout<<"yes"};

    return 0;

}