#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(20);
}


//#define int ll

unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void solve() {
    string a, b;
    cin >> a >> b;
    for (int t = min(a.length(), b.length()); t >= 0; --t) {
        set<vector<int>> inputs;
        vector<int> go(26, 0);
        REP(i, a.length()) {
            go[a[i] - 'a']++;
            if (i >= t) {
                go[a[i - t] - 'a']--;
            }
            if (i + 1 >= t) {
                inputs.insert(go);
            }
        }
        int ans = -1;
        REP(q, 26) {
            go[q] = 0;
        }
        REP(i, b.length()) {
            go[b[i] - 'a']++;
            if (i >= t) {
                go[b[i - t] - 'a']--;
            }
            if (i + 1 >= t) {
                if (inputs.count(go) == 1) {
                    ans = max(ans, t);
                    break;
                }
            }
        }
 
        if (ans != -1) {
            cout << ans << endl;
            return;
        }
    }
}

#undef int
int main() {
    init();
    solve();
}

