beecrowd | 1157
# Divisors I

**Timelimit: 1**

Adapted by Neilor Tonin, URI Brazil

Read an integer N and compute all its divisors.

The input file contains an integer value.

Write all positive divisors of N, one value per line.

Input Sample | Output Sample |

6 |
1 |