#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

vector<string> ans;
int n;
vector<string> s;
vii G;

void make_tree(int now) {
    int depth = 0;
    while (s[now][depth] == '.') depth++;
    for (int i = now + 1; i < n; i++) {
        int ndepth = 0;
        while (s[i][ndepth] == '.') ndepth++;
        if (ndepth > depth + 1) continue;
        else if (ndepth == depth + 1) {
            G[now].push_back(i);
            make_tree(i);
        }
        else return;
    }
}

void dfs(int now) {
    int depth = 0;
    while (s[now][depth] == '.') depth++;
    for (int j = depth; j < s[now].size(); j++) {
        ans[now][j] = s[now][j];
    }
    int ni = now + 1;
    for (int ch: G[now]) {
        while (ni < ch) {
            ans[ni][depth] = '|';
            ni++;
        }
        ans[ni][depth] = '+';
        ni++;
        dfs(ch);
    }
}

void solve() {
    ans.clear();
    ans.resize(n);
    rep (i, n) ans[i].resize(1500, ' ');
    G.clear();
    G.resize(n);
    make_tree(0);
    // DEBUG_MAT(G);
    dfs(0);

    for (int i = 0; i < n; i++) {
        while (ans[i].back() == ' ') ans[i].pop_back();
        cout << ans[i] << endl;
    }
}

signed main() {
    while (true) {
        cin >> n;
        if (n == 0) return 0;
        s.resize(n);
        rep (i, n) cin >> s[i];
        solve();
    }
}


Measured memory_bytes: 5332