X = int(input())

# Initial solution (m, c) = (7,5)
current_m = 7
current_c = 5

while True:
    # Check if current_c has exactly X digits
    if len(str(current_c)) == X:
        a = (current_m - 1) // 2
        b = a + 1
        print(f"{a} {b} {current_c}")
        break
    # Generate next solution using recurrence relations
    next_m = 3 * current_m + 4 * current_c
    next_c = 2 * current_m + 3 * current_c
    current_m, current_c = next_m, next_c