You are given three strings A, B and C. Check whether they form a word chain.

More formally, determine whether both of the following are true:

* The last character in A and the initial character in B are the same.
* The last character in B and the initial character in C are the same.



If both are true, print `YES`. Otherwise, print `NO`.

Constraints

* A, B and C are all composed of lowercase English letters (`a` - `z`).
* 1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.

Input

Input is given from Standard Input in the following format:


A B C


Output

Print `YES` or `NO`.

Examples

Input

rng gorilla apple


Output

YES


Input

yakiniku unagi sushi


Output

NO


Input

a a a


Output

YES


Input

aaaaaaaaab aaaaaaaaaa aaaaaaaaab


Output

NO
#include <bits/stdc++.h>
using namespace std;
int main() {
  int A, B, C, D, N, ans = 0;
  vector<int> V(3);
  char tmp1, tmp2;
  string S[3];
  bool flag = true;
  cin >> S[0] >> S[1] >> S[2];
  cout << S[0][0] << S[1][0] << S[2][0] << endl;
  if (S[0][S[0].size() - 1] != S[1][0] || S[1][S[1].size() - 1] != S[2][0])
    flag = false;
  if (flag)
    puts("YES");
  else
    puts("NO");
}
