#include <bits/stdc++.h>
using namespace std;
int main() {
  int A, B, n;
  while (~scanf("%d%d%d", &A, &B, &n)) {
    int flag = 1;
    int ans;
    for (int i = -1000; i <= 1000; i++) {
      if (fabs(A * pow(i * 1.0, n * 1.0) - 1.0 * B) < 1e-6) {
        ans = i;
        flag = 0;
        break;
      }
    }
    if (flag == 0) {
      printf("%d\n", ans);
      continue;
    } else {
      printf("No solution\n");
      continue;
    }
  }
}
