# Pyth, <s>21</s> <s>20</s> 18 bytes

 hoacFN.n3C_Bf!%QTS

[Try it online.][try] [Test suite.][test]

### Explanation

1. Get the inclu`S`ive range from 1 to input.
1. `f`ilter for numbers for that divide the input `!%QT`.
1. Get `[that list, that list reversed]` `_B`. The reversed divisors of a number is the same list as the number divided by each of the divisors.
1. Transpose the list to get pairs of `[numerator, denominator]`.
1. S`o`rt the pairs by the `a`bsolute difference of the ratio of the pair `cFN` and the golden ratio `.n3`.
1. Get the first (lowest) pair `h` and print.

[try]: http://pyth.herokuapp.com/?code=hoacFN.n3C_Bf!%25QTS&input=125&debug=0
[test]: http://pyth.herokuapp.com/?code=hoacFN.n3C_Bf!%25QTS&test_suite=1&test_suite_input=1%0A2%0A4%0A12%0A42%0A576%0A1234%0A10000%0A199999&debug=0