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>
int main() {
  int n;
  scanf("%d", &n);
  int v[n];
  int cont = n;
  int h = 0;
  while (h <= n - 1) {
    int i;
    scanf("%d", &i);
    v[h] = i;
    printf("%d\n", v[h]);
    if (h < n) h += 1;
  }
  int sla;
  int ini = 0;
  unsigned int max = 0;
  while (cont != 0) {
    printf("%d", sla);
    while (cont >= 0) {
      int xablau = 0;
      xablau = sla - v[ini];
      ini += 1;
      if (xablau > max) max = xablau;
    }
  }
  printf("%d \n", max);
  return 0;
}
