#include <bits/stdc++.h>
using namespace std;
long long int k, x;
long long int solve(long long int p, vector<long long int> &vec) {
  long long int i;
  if (p <= 0) {
    long long int s = 0;
    for (i = 0; i < vec.size(); i++) s = s + vec[i];
    return s;
  }
  long long int ans = INT_MAX, n = vec.size();
  for (i = 0; i < n; i++) {
    vector<long long int> newvec = vec;
    long long int j, x = newvec[i];
    swap(newvec[i], newvec[n - 1]);
    newvec.pop_back();
    for (j = 0; j < n - 1; j++) {
      newvec[j] = newvec[j] * x;
      ans = min(ans, solve(p - 1, newvec));
      newvec[j] /= x;
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string str;
  cin >> str;
  long long int n = str.length(), i, f = 1, l = 0, h = 0, j;
  string s = "";
  vector<string> name;
  vector<string> ext;
  for (i = 0; i < n; i++) {
    if (str[i] == '.') {
      if (l == 0) {
        if (h - l > 8 || h - l < 1) {
          cout << "NO\n";
          return 0;
        } else {
          s = str.substr(0, h);
          name.push_back(s);
        }
      } else if ((h - l) < 2 || (h - l) > 11) {
        cout << "NO\n";
        return 0;
      } else if ((h - l) > 3) {
        s = str.substr(l, 3);
        ext.push_back(s);
        s = str.substr(l + 3, (h - l) - 3);
        name.push_back(s);
      } else if ((h - l) <= 3) {
        s = str.substr(l, 1);
        ext.push_back(s);
        s = str.substr(l + 1, (h - l) - 1);
        name.push_back(s);
      }
      l = i + 1;
      h = i + 1;
    } else {
      h++;
    }
  }
  if (h != l) {
    if ((h - l) > 3) {
      cout << "NO\n";
      return 0;
    } else {
      s = str.substr(l, h - l + 1);
      ext.push_back(s);
    }
  }
  if (name.size() != ext.size()) {
    cout << "NO\n";
    return 0;
  } else {
    cout << "YES\n";
    for (i = 0; i < name.size(); i++) {
      cout << name[i] << "." << ext[i] << "\n";
    }
  }
  return 0;
}
