#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;


const LL mod1 = 1e9 + 7;
const LL mod2 = 1e9 + 9;
const LL mod = mod1 * mod2;

LL add(LL a, LL b)
{
	return a + b < mod ? a + b : a + b - mod;
}

LL mult(LL a, LL b)
{
	return (__int128)a * b % mod;
}
const int N = 26;

LL p = 47474747;
LL pw[N];

string s, t;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	pw[0] = 1;
	FOR (i, 1, 26)
		pw[i] = mult(pw[i - 1], p);
	
	cin >> s >> t;
	int n = SZ(s), m = SZ(t);
	vector<pair<int, LL>> v;
	FOR (l, 0, n)
	{
		LL h = pw[s[l] - 'a'];
		FOR (r, l + 1, n + 1)
		{
			v.PB({r - l, h});
			if (r != n)
				h = add(h, pw[s[r] - 'a']);
		}
	}
	int ans = 0;
	sort(ALL(v));
	FOR (l, 0, m)
	{
		LL h = pw[t[l] - 'a'];
		FOR (r, l + 1, m + 1)
		{
			int len = r - l;
			pair<int, LL> par = MP(len, h);
			int j = lower_bound(ALL(v), par) - v.begin();
			if (j < SZ(v) && v[j] == par)
				ans = max(ans, len);
			
			if (r != m)
				h = add(h, pw[t[r] - 'a']);
		}
	}
	cout << ans << '\n';
	return 0;
}