#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, n, i = 0, j, temp;
  int flag = 0, found = 0;
  cin >> a >> b >> n;
  if (a < 0) {
    a = -a;
    flag++;
  }
  if (b < 0) {
    b = -b;
    flag++;
  }
  while (1) {
    temp = 1;
    for (j = 0; j < n; j++) temp *= i;
    if (temp > b) break;
    if (a * temp == b) {
      found = 1;
      break;
    } else if (a * temp < b) {
      i++;
    } else
      break;
  }
  if (found) {
    if (flag == 1) cout << '-';
    cout << i << endl;
  } else
    cout << "No solution" << endl;
  return 0;
}
