Problem:
Score : 300 points

Problem Statement

You are given an integer N.

Find a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.

If there are multiple solutions, any of them will be accepted.

Constraints

It is guaranteed that, for the given integer N, there exists a solution such that h,n,w \leq 3500.

Inputs

Input is given from Standard Input in the following format:

N

Outputs

Print a triple of positive integers h, n and w that satisfies the condition, in the following format:

h n w

Sample Input 1

2

Sample Output 1

1 2 2

4/2 = 1/1 + 1/2 + 1/2.

Sample Input 2

3485

Sample Output 2

872 1012974 1539173474040

It is allowed to use an integer exceeding 3500 in a solution.

Sample Input 3

4664

Sample Output 3

3498 3498 3498

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
    public static bool f = false, t = true;
    static void Main(string[] args)
    {
        /*  long n = long.Parse(Console.ReadLine());
          long ans = 0;
          long max = 0,maxguy=0;
          long min = 0, minguy = 0 ;
          for(long i = 0; i < n; i++)
          {
              long[] s = Read.longs();
              if (s[1] > max) { max = s[1];maxguy = s[0]; }
              if (s[1] < min) { min = s[1];minguy = s[0]; }

          }
          ans = min - 1 + maxguy - 1;

          Console.WriteLine();
            );
      */
        int n = int.Parse(Console.ReadLine());
        for(int i = 1; i <= 1750; i++)
        {
            for (int j = 1; j <= 1750; j++)
            {
                for (int k = 1; k <= 1750; k++)
                {
                    if (n * (i * j + j * k + i * k) == 4 * i * j * k)
                    {
                        Console.WriteLine(i + " " + j + " " + k);
                        Console.ReadLine();
                        return;
                    }
                    int j1 = 3501 - j;
                    int i1 = 3501 - i;
                    int k1 = 3501 - k;
                    if (n * (i1 * j1 + j1 * k1 + i1 * k1) == 4 * i1 * j1 * k1)
                    {
                        Console.WriteLine(i1 + " " + j1 + " " + k1);
                        Console.ReadLine();
                        return;
                    }

                }
            }
        }
    }

    public static long gcd(long a, long b)
    {
        while (true)
        {
            if (a == 0) { return b; }
            if (b == 0) { return a; }
            if (a > b) { a -= b; }
            else { b -= a; }
        }
    }
    public static long lcm(long a, long b)
    {
        return a / gcd(a, b) * b;
    }
    public static bool IsPrime(long n)
    {
        if (n < 2) return false;
        if (n == 2) return true;

        for (long i = 2; i < n; i++)
        {
            if (n % i == 0) return false;
        }
        return true;
    }

}
public static class Read
{
    public static void outl(string n = "") { Console.WriteLine(n); return; }
    public static long Long()
    {
        return long.Parse(Console.ReadLine());
    }
    public static long[] longs()
    {
        return Console.ReadLine().Split().Select(long.Parse).ToArray();
    }
    public static int Int()
    {
        return int.Parse(Console.ReadLine());
    }
    public static int[] ints()
    {
        return Console.ReadLine().Split().Select(int.Parse).ToArray();
    }
    public static string Str() { return Console.ReadLine(); }
    public static string[] Strs() { return Console.ReadLine().Split(); }
}