#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                 //    #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,pa>
                            #define ppa pair<pa,int>
                            #define ppap pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }
                /*}
int pr[100010];
//int inv[100010];
 
int beki(int wa,int rr){
	if(rr==0) return 1ll;
	if(rr==1) return wa;
	if(rr%2==1) return (beki(wa,rr-1)*wa)%inf;
	int zx=beki(wa,rr/2);
	return (zx*zx)%inf;
}
  
void gya(){
	pr[0]=1;
	for(int i=1;i<100010;i++){
		pr[i]=(pr[i-1]*i)%inf;
	}
	for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
	
}

*/

                         //----------------kokomade tenpure------------


set<string> se;
vector<string> ve;
void dfs(string s,char c){
	//cout<<s<<" "<<c<<endl;
	if(c=='a'){
		if(se.find(s)==se.end()){
			ve.pb(s);
			se.insert(s);
		}

			return ;
	}
	
	int i=0;
	for(;i<s.length();i++){
		if(s[i]==c){
			break;
		}
		if(i==s.length()-1){
		i++;
			break;
		}
	}
	bool b=false;
	if(i!=s.length()){
	
	for(int j=0;j<i;j++){
		if(s[j]==(c-1)){
			s[j]=c;
			dfs(s,c-1);
			s[j]=c-1;
			b=1;
		}
	}
		return ;
	}
	
	else{
			for(int j=0;j<i;j++){
		if(s[j]==(c-1)){
			s[j]=c;
			dfs(s,c-1);
			s[j]=c-1;
			b=1;
		}
	}
		dfs(s,c-1);
		return ;
	}
	return ;
}

signed main(){
	int n,m,r,w,h,x,y,wa;
	
/*
	cin>>n>>w>>h;
	for(int i=0;i<n;i++){
		cin>>x>>y>>wa;
		
		a[max(x-wa+1,1)]++;
		a[min(x+wa+1,w+1)]--;
		b[max(y-wa+1,1)]++;
		b[min(y+wa+1,h+1)]--;
	}
	bool bb=true,bb2=true;
	for(int i=1;i<=w;i++){
		a[i] += a[i-1];
		if(a[i]==0) bb=false;
	}
	for(int i=1;i<=h;i++){
		b[i]+=b[i-1];
		if(b[i]==0) bb2=false;
	}
	
	if(bb||bb2)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	*/
	
	while(1){
		string s;
	//	int na,nb;
	cin>>s;
		if(s=="#") return 0;
		ve.clear();
		se.clear();
		dfs(s,'z');
		
		sort(ve.begin(),ve.end());
		
		cout<<ve.size()<<endl;
		if(ve.size()<=10){
			for(int i=0;i<ve.size();i++) cout<<ve[i]<<endl;
		}
		else{
			for(int i=0;i<5;i++) cout<<ve[i]<<endl;
			for(int i=ve.size()-5;i<ve.size();i++) cout<<ve[i]<<endl;
		}
	}
	
	
	
	return 0;
}

Measured memory_bytes: 5048