#include <bits/stdc++.h>
const unsigned long long inf = 1LL << 61;
const double eps = 1e-5;
using namespace std;
bool cmp(int a, int b) { return a > b; }
int poww(int a, int b) {
  int t = 1;
  for (int i = 1; i <= b; i++) {
    t *= a;
  }
  return t;
}
int main() {
  int n, a, b;
  while (cin >> a >> b >> n) {
    if (a == 0 && b == 0) {
      cout << 1 << endl;
      continue;
    }
    if (a == 0) {
      puts("No solution");
      continue;
    }
    if ((b % a) != 0) {
      puts("No solution");
      continue;
    }
    int c = b / a;
    int mark = 0;
    int ans;
    if (c >= 0)
      for (int i = 0; i <= c; i++) {
        if (c == poww(i, n)) {
          mark = 1;
          ans = i;
          break;
        }
      }
    else
      for (int i = c; i <= 0; i++) {
        if (c == poww(i, n)) {
          ans = i;
          mark = 1;
          break;
        }
      }
    if (mark)
      cout << ans << endl;
    else
      puts("No solution");
  }
  return 0;
}
