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.
# LUOGU_RID: 117826391
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
# define LL long long
int main () {
	string Ber,Bir;
	cin>>Ber>>Bir;
	for(int i=0;i<Ber.length();i++) {
		for(int j=Bir.length();j>=0;j--) {
			if(Ber[i]!=Bir[j]) {
				cout<<"NO";
				return 0;
			}
		}
	}
	cout<<"YES";
	return 0;
}
//12123213123123123123