#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    auto btime = time();
    string s,t; cin >> s >> t;
    set<string> st;
    int res = 1;
    while (1) {
        if (st.find(s) != st.end()) {
            cout << "Does not appear" << endl;
            return 0;
        }
        st.insert(s);
        if (st.size() > 100) {
            cout << "I'm bored" << endl;
            return 0;
        }
        if (s == t) {
            cout << st.size() << endl;
            return 0;
        }

        sort(s.begin(), s.end());
        string nxt = "";
        for (int i = 0; i < s.size(); ) {
            char c = s[i];
            int cnt = 0;
            while (i < s.size() and s[i] == c) {
                cnt += 1; i += 1;
            }
            nxt += to_string(cnt);
            nxt += c;
        }
        s = nxt;
        res += 1;
    }

}