The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word *s* from Berlandish into Birlandish as *t*. Help him: find out if he translated the word correctly.
The first line contains word *s*, the second line contains word *t*. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.
#include <iostream>
#include <string>

using namespace std;

int main() {
   
    string cadena1, cadena2;
    cin >> cadena1 >> cadena2;

    
 
     if (cadena1.size() != cadena2.size()) {
        cout << "NO" << endl;
        return 0;
    }


    
  for (int i = 0; i < cadena1.size(); i++) {
        
        if (cadena1[i] != cadena2[cadena1.size() - i-1 ]) 
       
        {
            cout << "NO" << endl;
            return 0;
        }
    
    }

    cout << "YES" << endl;
    return 0;

}   


