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;
const double PI = acos(-1.0);
int main() {
  int a, b, c, x;
  scanf("%d", &x);
  if (x % 2 == 0)
    a = 1;
  else
    a = 0;
  scanf("%d", &x);
  if (x % 2 == 0)
    b = 1;
  else
    b = 0;
  scanf("%d", &x);
  if (x % 2 == 0)
    c = 1;
  else
    c = 0;
  printf((a == 1 && b == 1 && c == 0) || (a != 1 && b != 1 && c != 0)
             ? "NO\n"
             : "YES\n");
  return 0;
}
