#include <iostream>
#include <vector>
#include <map>
#include <string.h>
#include <math.h>
#include <set>
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define cy cout << "YES\n"
#define cn cout << "NO\n"
#define nl "\n"
#define fi first
#define se second
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define sz(s) s.size()
#define f0r(j, n) for (ll i = j; i < n; i++)
template <typename T = int>
istream &operator>>(istream &in, vector<T> &v)
{
    for (auto &x : v)
        in >> x;
    return in;
}

template <typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v)
{
    for (const T &x : v)
        out << x << " ";
    return out;
}

void sherry()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
/*
int gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return (b, a % b);
}
*/
void solve()
{
    string s;
    cin >> s;
    vector<string> st;
    for (int i = 0; i < (1 << sz(s)); i++)
    {
        string t = "";
        for (int j = 0; j < sz(s); j++)
        {
            if (i & (1 << j))
            {
                t += s[j];
            }
        }
        if (!t.empty())
        {
            st.push_back(t);
        }
    }
    sort(all(st));
    for (auto &i : st)
    {
        cout << i << nl;
    }
}
int main()
{
    sherry();
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}