#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)


bool check(string &s, int x){
	vint used(26);
	rep(i,s.size()){
		if((1<<i)&x) used[s[i]-'a']++;
		if(used[s[i]-'a']>=2) return false;
	}
	if(used[25]) return false;
	used=vint(26,0);
	rep(i,s.size()){
		if((1<<i)&x){
			if(used[s[i]-'a'+1]) return false;
			used[s[i]-'a'+1]++;
		}
		else{
			if(s[i]>='b'&&!used[s[i]-'a']) return false;
			used[s[i]-'a']++;
		}
	}
	return true;
}

string func(string s, int x){
	rep(i,s.size()){
		if((1<<i)&x) s[i]++;
	}
	return s;
}

void mainmain(){
	string s;
	while(cin>>s){
		if(s=="#") return;
		priority_queue<string> pq1;
		priority_queue<string,vector<string>, greater<string> > pq2;
		int n = s.size();
		int cnt = 0;
		rep(i,1<<n){
			if(check(s, i)){
				cnt++;
				string t = func(s, i);
				pq1.push(t);
				if(pq1.size()>10) pq1.pop();
				pq2.push(t);
				if(pq2.size()>10) pq2.pop();
			}
		}
		vector<string> v;
		while(pq2.size()){
			v.PB(pq2.top());
			pq2.pop();
		}
		while(pq1.size()){
			v.PB(pq1.top());
			pq1.pop();
		}
		sort(ALL(v));
		v.erase(unique(ALL(v)), v.end());
		if(v.size()<10){
			cout<<cnt<<endl;
			rep(i,v.size()){
				cout<<v[i]<<endl;
			}
		}
		else{
			cout<<cnt<<endl;
			rep(i,5){
				cout<<v[i]<<endl;
			}
			rep(i,5){
				cout<<v[v.size()-5+i]<<endl;
			}
		}
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 3232