743C.md (1322B)
1 Source: https://codeforces.com/problemset/problem/743/C 2 3 C. Vladik and fractions 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer *n* he can represent fraction  as a sum of three distinct positive fractions in form . 22 23 Help Vladik with that, i.e for a given *n* find three distinct positive integers *x*, *y* and *z* such that . Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding 109. 24 25 If there is no such answer, print -1. 26 27 Input 28 29 The single line contains single integer *n* (1 ≤ *n* ≤ 104). 30 31 Output 32 33 If the answer exists, print 3 distinct numbers *x*, *y* and *z* (1 ≤ *x*, *y*, *z* ≤ 109, *x* ≠ *y*, *x* ≠ *z*, *y* ≠ *z*). Otherwise print -1. 34 35 If there are multiple answers, print any of them. 36 37 Examples 38 39 Input 40 41 ``` 42 3 43 ``` 44 45 Output 46 47 ``` 48 2 7 42 49 ``` 50 51 Input 52 53 ``` 54 7 55 ``` 56 57 Output 58 59 ``` 60 7 8 56 61 ```