#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> v;
  bool z = 1;
  int cnt = 0;
  for (int i = 0; i < n && z; i++) {
    if (s[i] == '.') {
      v.push_back(cnt);
      cnt = 0;
    } else {
      cnt++;
    }
  }
  v.push_back(cnt);
  if (v.size() == 1) {
    cout << "NO" << '\n';
    return;
  }
  if (v[0] > 8 || v[v.size() - 1] > 3) {
    cout << "NO" << '\n';
    return;
  }
  for (int i = 0; i < v.size(); i++) {
    if (v[i] == 0 || v[i] > 11) {
      cout << "NO" << '\n';
      return;
    }
  }
  for (int i = 1; i < v.size() - 1; i++) {
    if (v[i] == 1) {
      cout << "NO" << '\n';
      return;
    }
  }
  vector<int> v1;
  for (int i = 0; i < v.size() - 1; i++) {
    int x = v[i];
    if (i + 1 == v.size() - 1) {
      x += v[i + 1];
    } else if (v[i + 1] <= 3) {
      x += (v[i + 1] - 1);
      v[i + 1] = 1;
    } else {
      x += 3;
      v[i + 1] -= 3;
    }
    v1.push_back(x);
  }
  cout << "YES" << '\n';
  int i = 0;
  for (int j = 0; j < v1.size(); j++) {
    int k = 0;
    while (k <= v1[j]) {
      cout << s[i];
      i++;
      k++;
    }
    cout << '\n';
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
