main() {
    // square root of a fixed-point number
    // stored in a 32 bit integer variable, shift is the precision
    int sqrt(int n, int shift) {
        int x;
        int x_old;
        int n_one;
        if n > 2147483647/shift { // pay attention to potential overflows
            return 2 * sqrt(n / 4, shift);
        }
        x = shift; // initial guess 1.0, can do better, but oh well
        n_one = n * shift; // need to compensate for fixp division
        while true {
            x_old = x;
            x = (x + n_one / x) / 2;
            if abs(x - x_old) <= 1 {
                return x;
            }
        }
    }
    int abs(int x) {
        if x < 0 {
            return -x;
        } else {
            return x;
        }
    }
    // 25735 is approximately equal to pi * 8192;
    // expected value of the output is sqrt(pi) * 8192 approx 14519
    println sqrt(25735, 8192);
}