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 <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
#define ll long long
#define ar array
static auto _ = [] {
    std::ios::sync_with_stdio (0);
    std::cin.tie (0);
    std::cout.tie (0);
    std::cerr.tie (0);
    return 0;
}
();

void solve() {
    string s1, s2;
    cin >> s1 >> s2;
    reverse(s2.begin(), s2.end());
    if(!s1.compare(s2)){
        cout << "YES" <<endl;
    } else {
        cout << "NO" << endl;
    }
}

int main() {
    ios::sync_with_stdio (0);
    cin.tie (0);
    int testCases;
    testCases = 1;
    while (testCases --) {
        solve();
    }
    return 0;
}

