#include <bits/stdc++.h>
using namespace std;
long long ppow(int x, int n) {
  long long res = 1;
  while (n--) res *= x;
  return res;
}
int main() {
  int a, b, n;
  cin >> a >> b >> n;
  double res, prev;
  for (int x = 0;; x++) {
    prev = res;
    res = a * (ppow(x, n));
    if (abs(res) == abs(b)) {
      cout << (isnan(b / abs(b)) ? 1 : b / abs(b)) *
                  (isnan(res / abs(res)) ? 1 : res / abs(res)) * x
           << endl;
      return 0;
    }
    if (abs(res) > abs(b) || res == prev) break;
  }
  cout << "No solution" << endl;
  return 0;
}
