#include <bits/stdc++.h>
using namespace std;
const int P = 1e3;
long long A, B, N;
int main() {
  scanf("%I64d %I64d %I64d", &A, &B, &N);
  long long ans = 0;
  bool check = false;
  for (int i = -P; i <= P; i++) {
    long long x = 1, tot = i;
    int cnt = 0;
    while (cnt < N) {
      x *= tot;
      if (abs(A * x) > abs(B)) break;
      cnt++;
    }
    if (cnt == N && A * x == B) ans = tot, check = true;
  }
  if (!check)
    printf("No solution\n");
  else
    printf("%I64d\n", ans);
}
