n = gets.to_s.to_i

t = n
t /= 2 while t.even?
if t == 1
  puts "-1 -1 -1"
  exit
end

c = n
a = n.to_s(2)[1..-1].to_i(2)
b = a ^ c

puts "#{a} #{b} #{c}"



# C == N
# A or B == N
# A xor B xor C == N -> A xor B == N

# p 2**30
# kanou = []
# (1..33).each do |i|
#   (i..33).each do |j|
#     next if i == j
#     k = i^j
#     n = (i | j)
#     kanou << [i, j, k, i.to_s(2), j.to_s(2), k.to_s(2), n.to_s(2), (i | k).to_s(2), (k | j).to_s(2), (k | j)] if n == (i | k) && n == (j | k) #&& n == 6
#   end
# end

# pp kanou.sort_by(&:last)

# 0b11
# 0b01
# 0b10
# 0b11





# ans = prob.numerator * prob.denominator.pow(mod - 2, mod) % mod

# puts ans 

# [1, 2, 3]
# 1 [(1+1), (2+1), (3+1)] -> []
# 2 [(1+2), (2+2), (3+2)]
# 3 [4, 5, 6]