#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 998244353;
const int inf = 0x3f3f3f3f;
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ return (int)(1ll * a * b % Mod); }

string s, t;
int cs[33], ct[33], p[33], r[33];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> s >> t;
	rep(i, (int)s.size()) ++cs[s[i] - 'a'];
	rep(i, (int)t.size()) ++ct[t[i] - 'a'];

	int res = 0;
	for(int x = 1; x <= (int)t.size(); ++x){
		bool ok = 1;
		rep(i, 26){
			int lb = (ct[i] + x) / (x+1), ub = ct[i] / x;
			if(lb > ub){ ok = 0; break; }
			p[i] = lb, r[i] = ct[i] - x * p[i];
		}
		if(!ok) continue;
		int ans = inf, can = 1;
		rep(i, 26) if(ct[i]) ans = min(ans, cs[i] / p[i]);
		rep(i, 26) if(ct[i]) can &= (cs[i] - ans * p[i] >= r[i]);
		//cout << x << ": " << ans << " " << can << endl;
		res = max(res, ans + can - x);
	}

	cout << res << "\n";

	return 0;
}