#include <bits/stdc++.h>
using namespace std;
const double TOLL = 1e-7;
int main() {
  int a, b, n;
  while (cin >> a >> b >> n) {
    int sign = a * b;
    int ta = a, tb = b;
    a = abs(a);
    b = abs(b);
    double r = 1.0 * b / a;
    int x = exp(log(r) / n) + TOLL;
    if (sign < 0) x *= -1;
    double TEMP = pow(x, n);
    if (TEMP > -0.5)
      TEMP += TOLL;
    else
      TEMP -= TOLL;
    long long val = 1ll * ta * TEMP;
    if (val == tb)
      cout << x << endl;
    else
      cout << "No solution" << endl;
  }
  return 0;
}
