#include <bits/stdc++.h>
using namespace std;
struct na {
  string s;
  long long int v;
  int id;
};
bool compare(na a, na b) {
  if (a.s != b.s) {
    return a.v < b.v;
  } else {
    return a.id < b.id;
  }
}
void init() {}
int binarySearch(long long int arr[], int l, int r, long long int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, i;
  cin >> n;
  struct na b[n];
  for (i = 0; i < n; i++) {
    cin >> b[i].s;
    b[i].v = b[i].s.size();
    b[i].id = i;
  }
  sort(b, b + n, compare);
  int c = 0;
  string str, str1;
  for (i = 0; i < n - 1; i++) {
    str = b[i + 1].s;
    str1 = b[i].s;
    size_t found = str.find(str1);
    if (found != string::npos) {
      c++;
    } else {
      break;
    }
  }
  if (c == n - 1) {
    cout << "YES"
         << "\n";
    for (i = 0; i < n; i++) {
      cout << b[i].s << "\n";
    }
  } else {
    cout << "NO"
         << "\n";
  }
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

You are given n strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.

String a is a substring of string b if it is possible to choose several consecutive letters in b in such a way that they form a. For example, string "for" is contained as a substring in strings "codeforces", "for" and "therefore", but is not contained as a substring in strings "four", "fofo" and "rof".

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of strings.

The next n lines contain the given strings. The number of letters in each string is from 1 to 100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder n given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and n given strings in required order.

Examples

Input

5
a
aba
abacaba
ba
aba


Output

YES
a
ba
aba
aba
abacaba


Input

5
a
abacaba
ba
aba
abab


Output

NO


Input

3
qwerty
qwerty
qwerty


Output

YES
qwerty
qwerty
qwerty

Note

In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
struct na {
  string s;
  long long int v;
  int id;
};
bool compare(na a, na b) {
  if (a.s != b.s) {
    return a.v < b.v;
  } else {
    return a.id < b.id;
  }
}
void init() {}
int binarySearch(long long int arr[], int l, int r, long long int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, i;
  cin >> n;
  struct na b[n];
  for (i = 0; i < n; i++) {
    cin >> b[i].s;
    b[i].v = b[i].s.size();
    b[i].id = i;
  }
  sort(b, b + n, compare);
  int c = 0;
  string str, str1;
  for (i = 0; i < n - 1; i++) {
    str = b[i + 1].s;
    str1 = b[i].s;
    size_t found = str.find(str1);
    if (found != string::npos) {
      c++;
    } else {
      break;
    }
  }
  if (c == n - 1) {
    cout << "YES"
         << "\n";
    for (i = 0; i < n; i++) {
      cout << b[i].s << "\n";
    }
  } else {
    cout << "NO"
         << "\n";
  }
  return 0;
}

```