#include <bits/stdc++.h>
using namespace std;
long long pum(long long A, long long N) {
  if (N == 1LL) return A;
  long long w = pum(A, N / 2LL);
  if (N % 2LL) {
    if (abs(w * w * A) <= 1000LL)
      return w * w * A;
    else
      return 2000LL;
  }
  if (abs(w * w) <= 1000LL)
    return w * w;
  else
    return 2000LL;
}
int main() {
  long long A, B, N, X;
  cin >> A >> B >> N;
  for (X = -1000LL; X <= 1000LL; X++) {
    if ((X != 0LL || N != 0LL) && pum(X, N) * A == B) {
      cout << X << endl;
      return 0;
    }
  }
  printf("No solution\n");
  return 0;
}
