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>
#define f(i,n) for(int i=0;i<n;i++)
#define fs for(int i=0;s[i];i++)
using namespace std;

int main(){
	//long long  int n,x=0;
	string s,t;
	cin>>s>>t;
	reverse(t.begin(),t.end());
	cout<<(s==t ? "YES":"NO")<<endl;
	return 0;
}