Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

import fractions
#import math
from functools import reduce
def lcm_base(x, y):
  return (x * y) // fractions.gcd(x, y)
  #return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
  return reduce(lcm_base, numbers, 1)

for h in range(1, 3501):
    l = lcm_base(N, h)
    for n in range(h, 3501):
        l = lcm_base(l, n)
        x = 4*(l//N)-l//h-l//n
        if x <= 0:
            continue
        else:
            if l%x == 0:
                print(h, n, l//x)
                exit()


Fixed submission:
N = int(input())

for h in range(1, 3501):
    for n in range(h, 3501):
        x = 4*h*n-N*n-N*h
        if x <= 0:
            continue
        else:
            if (N*h*n)%x == 0:
                print(h, n, (N*h*n)//x)
                exit()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

import fractions
#import math
from functools import reduce
def lcm_base(x, y):
  return (x * y) // fractions.gcd(x, y)
  #return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
  return reduce(lcm_base, numbers, 1)

for h in range(1, 3501):
    for n in range(h, 3501):
        l = lcm_list([N, h, n])
        x = 4*(l//N)-l//h-l//n
        if x <= 0:
            continue
        else:
            if l%x == 0:
                print(h, n, l//x)
                exit()


Fixed submission:
N = int(input())

for h in range(1, 3501):
    for n in range(h, 3501):
        x = 4*h*n-N*n-N*h
        if x <= 0:
            continue
        else:
            if (N*h*n)%x == 0:
                print(h, n, (N*h*n)//x)
                exit()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

import fractions
#import math
from functools import reduce
def lcm_base(x, y):
  return (x * y) // fractions.gcd(x, y)
  #return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
  return reduce(lcm_base, numbers, 1)

for h in range(1, 3501):
    for n in range(1, 3501):
        l = lcm_list([N, h, n])
        x = 4*(l//N)-l//h-l//n
        if x <= 0:
            continue
        else:
            if l%x == 0:
                print(h, n, l//x)
                exit()


Fixed submission:
N = int(input())

for h in range(1, 3501):
    for n in range(h, 3501):
        x = 4*h*n-N*n-N*h
        if x <= 0:
            continue
        else:
            if (N*h*n)%x == 0:
                print(h, n, (N*h*n)//x)
                exit()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

import fractions
#import math
from functools import reduce
def lcm_base(x, y):
  return (x * y) // fractions.gcd(x, y)
  #return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
  return reduce(lcm_base, numbers, 1)

for h in range(1, 3501):
    for n in range(1, 3501):
        l = lcm_list([N, h, n])
        x = 4*(l//N)-l//h-l//n
        if x <= 0:
            continue
        else:
            if l%x == 0:
                print(h, n, l//x)
                exit()


Fixed submission:
N = int(input())

for h in range(1, 3501):
    for n in range(h, 3501):
        x = 4*h*n-N*n-N*h
        if x <= 0:
            continue
        else:
            if (N*h*n)%x == 0:
                print(h, n, (N*h*n)//x)
                exit()