Problem: Eudokimus, a system administrator is in trouble again. As a result of an error in some script, a list of names of very important files has been damaged. Since they were files in the BerFS file system, it is known that each file name has a form "name.ext", where: 

  * name is a string consisting of lowercase Latin letters, its length is from 1 to 8 characters; 
  * ext is a string consisting of lowercase Latin letters, its length is from 1 to 3 characters. 



For example, "read.me", "example.txt" and "b.cpp" are valid file names and "version.info", "ntldr" and "contestdata.zip" are not.

Damage to the list meant that all the file names were recorded one after another, without any separators. So now Eudokimus has a single string.

Eudokimus needs to set everything right as soon as possible. He should divide the resulting string into parts so that each part would be a valid file name in BerFS. Since Eudokimus has already proved that he is not good at programming, help him. The resulting file list can contain the same file names.

Input

The input data consists of a single string s, its length is from 1 to 4·105 characters. The string can contain only lowercase Latin letters ('a' - 'z') and periods ('.').

Output

In the first line print "YES" (without the quotes), if it is possible to divide s into parts as required. In this case, the following lines should contain the parts of the required partition, one per line in the order in which they appear in s. The required partition can contain the same file names. If there are multiple solutions, print any of them.

If the solution does not exist, then print in a single line "NO" (without the quotes).

Examples

Input

read.meexample.txtb.cpp


Output

YES
read.m
eexample.t
xtb.cpp


Input

version.infontldrcontestdata.zip


Output

NO

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

//import Number_theory.pair;

public class hacker49 {
	public static int r1=0;
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
	static class pair{
		private long cnt;
		private long[] fq;
		private long[] pref;
		pair(){
			fq=new long[41];
			pref=new long[41];
			cnt=(long)0;
		}	
	}
	static long ans(long n,long k,long a,long b) {
		if(k==1) {
			return (long)((n-1)*a);
		}
		if(n==1) {
			return 0;
		}
		if(n<k) {
			return (long)(a*(n-1));
		}
		if(n==k) {
			return (long)Math.min(b,(k-1)*a);
		}
		if(n%k==0) {
//			long f1=(long)(b+(long)ans(n/k,k,a,b));
			long g=n-(n/k);
			long f2=g*a;
			if(f2<b) {
				return (long)(f2+(long)ans(n/k,k,a,b));
			}else {
				return (long)(b+ans(n/k,k,a,b));
			}
//			long f2=(long)((long)(g*a)+(long)ans(n/k,k,a,b));
//			return (long)Math.min(f1, f2);
		}else {
			long d=(long)(n%k);
			n-=d;
			return (long)((long)d*a+(long)ans(n,k,a,b));
		}
	}
	static class pair3{
		private int a;
		private int b;
		pair3(int a,int b){
			this.a=a;
			this.b=b;
		}
	}
	static HashMap<Long,Integer> e=new HashMap<>();
	public static void main(String[] args) {
		OutputStream outputStream =System.out;
	    PrintWriter out =new PrintWriter(outputStream);
		FastReader s=new FastReader();
	   String str=s.next();
	   int n=str.length();
	   ArrayList<Integer> e=new ArrayList<>();
	   ArrayList<pair3> e1=new ArrayList<>();
	   int count=0;
	   for(int i=0;i<n;i++) {
		   if(str.charAt(i)!='.') {
			   count++;
		   }else {
			   e.add(count);
			   count=0;
		   }
	   }
	   e.add(count);
	   boolean p=true;
	   out:for(int i=0;i<e.size();i++) {
		   if(i==0) {
			   if(e.get(0)>8) {
				   p=false;
				   break out;
			   }else if(e.get(0)<1) {
				   p=false;
				   break out;
			   }
			   
			   else {
				   e1.add(new pair3(e.get(0),0));
			   }
		   }else if(i==e.size()-1) {
			   if(e.get(i)>3) {
				   p=false;
				   break out;
			   }else if(e.get(i)<1) {
				   p=false;
				   break out;
			   }
			   
			   else {
				   e1.add(new pair3(e.get(i),0));
			   }
		   }else {
			   if(e.get(i)<2 || e.get(i)>11) {
				   p=false;
				   break out;
			   }else {
				   
				   if(e.get(i)<=3) {
					   e1.add(new pair3(1,e.get(i)-1));
				   }else {
					   e1.add(new pair3(3,e.get(i)-3));
				   }
				   
			   }
			   
		   }
		   
	   }
	   if(!p) {
		   out.println("NO");
	   }else if(e.size()==1) {
		  out.println("NO");
	   }
	   else {
		   out.println("YES");
		   int j=0;
		for(int i=0;i<e1.size();i++) {
			int count1=0;
			if(i==0) {
				while(count1<e1.get(0).a) {
					out.print(str.charAt(j));
					count1++;
					j++;
				}
				out.print(".");
				j++;
			}else if(i==e1.size()-1){
				while(j<n) {
					out.print(str.charAt(j));
					j++;
				}
				
				
			}else {
				while(count1<e1.get(i).a) {
					out.print(str.charAt(j));
				j++;
				count1++;
				}
				out.println();
				count1=0;
				while(count1<e1.get(i).b) {
					out.print(str.charAt(j));
					count1++;
					j++;
				}
				out.print(".");
				j++;
			}
		}
	   }
		out.close();
       
	}

	static int nextPowerOf2(int n) 
	{ 
	    n--; 
	    n |= n >> 1; 
	    n |= n >> 2; 
	    n |= n >> 4; 
	    n |= n >> 8; 
	    n |= n >> 16; 
	    n++; 
	      
	    return n; 
	} 
//	static class node{
//		private int a;
//		private int b;
//		private int c;
//		private int d;
//		
//	}
	static ArrayList<Integer>[][] f1=new ArrayList[101][101];
	static boolean[][] vis=new boolean[101][101];
public static void dfs(int node,int c) {
	vis[c][node]=true;
	for(int i=0;i<f1[c][node].size();i++) {
		if(!vis[c][f1[c][node].get(i)]) {
			dfs(f1[c][node].get(i),c);
		}
	}
}
	
	
	public static class node{
		private int a;
		private int b;
		node(int a,int b){
			this.a=a;
			this.b=b;
		}
	}

	public static long GCD(long a,long b) {
		if(b==(long)0) {
			return a;
		}
		return GCD(b , a%b);
	}
	public static void Create(node[] arr,node[] segtree,int low,int high,int pos) {
		if(low==high) {
			segtree[pos]=arr[low];
			return;
		}
		int mid=(low+high)/2;
		Create(arr,segtree,low,mid,2*pos+1);
		Create(arr,segtree,mid+1,high,2*pos+2);
		if(segtree[2*pos+1].a+segtree[2*pos+2].a>=10) {
			int a=segtree[2*pos+1].a;
			int b=segtree[2*pos+2].a;
			int c=segtree[2*pos+1].b;
			int d=segtree[2*pos+2].b;
			segtree[pos]=new node((a+b)%10,1+c+d);
		}else {
			int a=segtree[2*pos+1].a;
			int b=segtree[2*pos+2].a;
			int c=segtree[2*pos+1].b;
			int d=segtree[2*pos+2].b;
			segtree[pos]=new node(a+b,c+d);
			
		}
	}
	public static node Query(node[] segtree,int qlow,int qhigh,int low,int high,int pos) {
		if(low>=qlow && high<=qhigh) {
			return segtree[pos];
		}
		if(qhigh<low || qlow>high) {
			return new node(0,0);
		}
		int mid=(low+high)/2;
	 node a=Query(segtree,qlow,qhigh,low,mid,2*pos+1);
	node b=Query(segtree,qlow,qhigh,mid+1,high,2*pos+2);
	int c=a.a;
	int d=b.a;
	if(c+d>=10) {
	node e=new node((c+d)%10,1+a.b+b.b);
	return e;
	}else {
		node e=new node(c+d,a.b+b.b);
		return e;
	}
	}
	
	static class pair1 implements Comparable<pair1>{
		private int a;
		private int b;
		private int c;
		private int d;
		pair1(int a,int b,int c,int d){
			this.a=a;
			this.b=b;
			this.c=c;
			this.d=d;
		}
		public int compareTo(pair1 o) {
			if(this.a<o.a) {
				return 1;
			}else if(this.a==o.a) {
				if(this.b<o.b) {
					return 1;
				}else {
					return -1;
				}
			}else {
				return -1;
			}
				
		}
	}
//	public static class pair5{
//		private int a;
//		private int b;
//		pair5(int a,int b){
//			this.a=a;
//			this.b=b;
//		}
//		public int compareTo(pair5 o) {
//			return Integer.compare(o.b, this.b);
//		}
//	}
//	public static pair5[] merge_sort(pair5[] A, int start, int end) {
//		if (end > start) {
//			int mid = (end + start) / 2;
//			pair5[] v = merge_sort(A, start, mid);
//			pair5[] o = merge_sort(A, mid + 1, end);
//			return (merge(v, o));
//		} else {
//			pair5[] y = new pair5[1];
//			y[0] = A[start];
//			return y;
//		}
//	}
//	public static pair5[] merge(pair5 a[], pair5 b[]) {
////		int count=0;
//		pair5[] temp = new pair5[a.length + b.length];
//		int m = a.length;
//		int n = b.length;
//		int i = 0;
//		int j = 0;
//		int c = 0;
//		while (i < m && j < n) {
//			if (a[i].a < b[j].a) {
//				temp[c++] = a[i++];
//			} else {
//				temp[c++] = b[j++];
//			}
//		}
//		while (i < m) {
//			temp[c++] = a[i++];
//		}
//		while (j < n) {
//			temp[c++] = b[j++];
//		}
//		return temp;
//	}
////	
//	public static int upper_bound(long[] a ,int n,long x) {
//		int l=-1;
//		int r=n;
//		while(r>l+1) {
//			int mid=(l+r)/2;
//			if(a[mid]<x) {
//				l=mid;
//			}else {
//				r=mid;
//			}
//		}
//		return r;
//				
//	}
//
//	
//	
//	public static int lower_bound(pair5[] a ,int n,int x) {
//		int l=-1;
//		int r=n;
//		while(r>l+1) {
//			int mid=(l+r)/2;
//			if(a[mid].a<x) {
//				l=mid;
//			}else {
//				r=mid;
//			}
//		}
//		return l;
//				
//	}
	static boolean isValid(int x,int y,int n,int m) {
		if(x>=1 && x<=n && y>=1 && y<=m) {
			return true;
		}else {
			return false;
		}
	}
	public static boolean equal_Sum_Partition(long[] a,int n) {
		 long sum=0;
		 for(int i=1;i<=n;i++) {
			 sum+=a[i];
		 }
		 if(sum%2!=0) {
			 return false;
		 }else {
			 return subset_Sum_Using_Knapsack(a,n,sum/2);
		 }
	 }
	public static boolean subset_Sum_Using_Knapsack(long[] a,int n,long sum) {
		 int[][] dp=new int[n+1][(int) (sum+1)];
		 for(int i=0;i<=n;i++) {
			 dp[i][0]=1;
		 }
		 for(int i=1;i<=n;i++) {
			 for(int j=1;j<=sum;j++) {
				 if(a[i]<=j) {
					 dp[i][j]=Math.max((dp[i-1][j]),(dp[i-1][(int) (j-a[i])]));
				 }else {
					 dp[i][j]=dp[i-1][j];
				 }
			 }
		 }
		 return dp[n][(int) sum]==1;
	 }
	static long[] fac=new long[1000001];
	static void fac() {
		fac[0]=1;
		for(int i=1;i<=1000000;i++) {
			fac[i]=((fac[i-1]%mod)*(i%mod))%mod;
		}
	}
	static ArrayList<Integer>[] f=new ArrayList[2001];
	public static void init(int n) {
		
		for(int j=1;j<=n;j++) {
		for (int l=1; l<=Math.sqrt(j); l++)
        {
            if (j%l==0)
            {
                // If divisors are equal, print only one
                if (j/l == l) {
                    f[j].add(l);}
      
                else { // Otherwise print both
//                    System.out.print(i+" " + n/i + " " );
            f[j].add(l);
            f[j].add(j/l);
                }
                
            }
        }
		
		}
		
	}
	public static int rod_cutting_with_left_right_strategy(int[] a,int n) {
		int[] dp=new int[n+1];
		dp[1]=a[1];
		for(int i=2;i<=n;i++) {
			dp[i]=a[i];
			int left=1;
			int right=i-1;
			while(left<=right) {
				dp[i]=Math.max(dp[left]+dp[right],dp[i]);
			left++;
			right--;
			}
			
		}
		return dp[n];
	}
	public static long[] merge_sort(long[] A, int start, int end) {
		if (end > start) {
			int mid = (end + start) / 2;
			long[] v = merge_sort(A, start, mid);
			long[] o = merge_sort(A, mid + 1, end);
			return (merge(v, o));
		} else {
			long[] y = new long[1];
			y[0] = A[start];
			return y;
		}
	}
	public static long[] merge(long a[], long b[]) {
//		int count=0;
		long[] temp = new long[a.length + b.length];
		int m = a.length;
		int n = b.length;
		int i = 0;
		int j = 0;
		int c = 0;
		while (i < m && j < n) {
			if (a[i] > b[j]) {
				temp[c++] = a[i++];
			
			} else {
				temp[c++] = b[j++];
			}
		}
		while (i < m) {
			temp[c++] = a[i++];
		}
		while (j < n) {
			temp[c++] = b[j++];
		}
		return temp;
	}
	
	public static long[] merge_sort1(long[] A, int start, int end) {
		if (end > start) {
			int mid = (end + start) / 2;
			long[] v = merge_sort1(A, start, mid);
			long[] o = merge_sort1(A, mid + 1, end);
			return (merge1(v, o));
		} else {
			long[] y = new long[1];
			y[0] = A[start];
			return y;
		}
	}
	public static long[] merge1(long a[], long b[]) {
//		int count=0;
		long[] temp = new long[a.length + b.length];
		int m = a.length;
		int n = b.length;
		int i = 0;
		int j = 0;
		int c = 0;
		while (i < m && j < n) {
			if (a[i] > b[j]) {
				temp[c++] = a[i++];
			
			} else {
				temp[c++] = b[j++];
			}
		}
		while (i < m) {
			temp[c++] = a[i++];
		}
		while (j < n) {
			temp[c++] = b[j++];
		}
		return temp;
	}
	
	static long mod=1000000007;
	static class pair2{
		private long a;
		private int b;
		pair2(long a,int b){
			this.a=a;
			this.b=b;
		}
	}
	




//	for(int i=2;i<=100000;i++) {
		
	
}