#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
bool minimize(int &u, int v){
if (u<v){
return 0;
}
u=v;
return 1;
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int n;
string s[MAXN];
namespace sub1{
int dp[MASK(18)][19];
ii trace[MASK(18)][19];
int cost(int i, int j){
int t=0;
while (t<(int)min(s[i].size(),s[j].size())&&s[i][t]==s[j][t]) ++t;
return (int)s[i].size()-t+(int)s[j].size()-t+1;
}
void solve(){
memset(dp,0x3f,sizeof(dp));
FOR(i,1,n) dp[MASK(i-1)][i]=cost(0,i);
FOR(mask,1,MASK(n)-1){
for (int haha=mask; haha>0; haha^=haha&-haha){
int i=__builtin_ctz(haha)+1;
for (int hihi=MASK(n)-1-mask; hihi>0; hihi^=hihi&-hihi){
int j=__builtin_ctz(hihi)+1;
if (minimize(dp[mask|MASK(j-1)][j],dp[mask][i]+cost(i,j))){
trace[mask|MASK(j-1)][j]={mask,i};
}
}
}
}
int res=INF;
ii cur;
FOR(i,1,n) if (minimize(res,dp[MASK(n)-1][i])) cur={MASK(n)-1,i};
cout<<res<<"\n";
vector<int> path;
while (cur.fs>0){
path.pb(cur.sc);
ii tmp=trace[cur.fs][cur.sc];
cur=tmp;
}
reverse(all(path));
for (char c:s[path[0]]) cout<<c<<"\n";
cout<<"P\n";
FOR(i,1,(int)path.size()-1){
int x=cost(path[i-1],path[i]);
int t=(s[path[i-1]].size()+s[path[i]].size()-x+1)/2;
FOR(j,t,(int)s[path[i-1]].size()-1) cout<<"-\n";
FOR(j,t,(int)s[path[i]].size()-1) cout<<s[path[i]][j]<<"\n";
cout<<"P\n";
}
}
}
int main()
{
// freopen(name".inp","r",stdin);
// freopen(name".out","w",stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n;
FOR(i,1,n) cin>>s[i];
if (n<=18) sub1::solve();
//else sub2::solve();
return 0;
}
