// Problem: P6921 [ICPC2016 WF] Forever Young
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P6921
// Memory Limit: 1 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

ll n;
char s[99];

inline ll calc(ll x) {
	lll y = 0;
	for (int i = 0; s[i]; ++i) {
		y = y * x + s[i] - '0';
		if (y > n) {
			return n + 1;
		}
	}
	return y;
}

inline bool check(ll x) {
	ll t = n;
	while (t) {
		if (t % x > 9) {
			return 0;
		}
		t /= x;
	}
	return 1;
}

void solve() {
	scanf("%lld%s", &n, s);
	ll l = 10, r = 1e18, pos = -1;
	while (l <= r) {
		ll mid = (l + r) >> 1;
		if (calc(mid) <= n) {
			pos = mid;
			l = mid + 1;
		} else {
			r = mid - 1;
		}
	}
	ll ans = 0;
	for (ll i = min(pos, 1000000LL); i >= 10; --i) {
		if (check(i)) {
			ans = i;
			break;
		}
	}
	for (int i = 10; i <= 999; ++i) {
		int x = i, m = 0;
		while (x) {
			s[m++] = '0' + x % 10;
			x /= 10;
		}
		reverse(s, s + m);
		s[m] = '\0';
		ll l = 10, r = pos, p = -1;
		while (l <= r) {
			ll mid = (l + r) >> 1;
			if (calc(mid) <= n) {
				p = mid;
				l = mid + 1;
			} else {
				r = mid - 1;
			}
		}
		if (p != -1 && calc(p) == n) {
			ans = max(ans, p);
			break;
		}
	}
	printf("%lld\n", ans);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}