import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

void main() {
    long N;
    scan(N);

    foreach(h ; 1 .. 3501) {
        foreach (n ; 1 .. 3501) {
            long x = 4L * h * n;
            long hn = 1L * h * n;

            //writeln(x, " " , hn);
            
            if (x % N) {
                continue;
            }

            long denom = 4L * h * n / N - n - h;

            //writeln(denom);

            if (denom <= 0 || hn % denom) {
                continue;
            }

            debug {
                //writeln(hn, denom);
            }

            long w = hn / denom;

            if (0 < w && w <= 3500) {
                writeln(h, " ", n, " ", w);
                return;
            }

        }
    }
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}