Cream puff

AtCoder

IDabc180_c

Time2000ms

Memory256MB

Difficulty—

We have $N$ cream puffs. Find all possible number of people to which we can evenly distribute the cream puffs without cutting them. ## Constraints * $1 \leq N \leq 10^{12}$ * $N$ is an integer. ## Input Input is given from Standard Input in the following format: $N$ [samples]

Samples

Input #1

Output #1

1
2
3
6

For example, we can evenly distribute the cream puffs to two people by giving three to each person.

Input #2

Output #2

Input #3

1000000007

Output #3

1
1000000007

API Response (JSON)

{
  "problem": {
    "name": "Cream puff",
    "description": {
      "content": "We have $N$ cream puffs. Find all possible number of people to which we can evenly distribute the cream puffs without cutting them.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc180_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have $N$ cream puffs.\nFind all possible number of people to which we can evenly distribute the cream puffs without cutting them.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^{12}$\n*   $N$ is an integer.\n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments