// Arup Guha
// 1/16/2026
// Solution to Kattis Problem: Positive Divisors
// https://open.kattis.com/problems/positivedivisors

import java.util.*;

public class positivedivisors {

	public static void main(String[] args) {
	
		// Get the input.
		Scanner stdin = new Scanner(System.in);
		long n = stdin.nextLong();
		
		ArrayList<Long> div = new ArrayList<Long>();
		
		// Just go to square root and add pairs of divisors, except square root.
		for (long i=1; i*i<=n; i++) {
			if (n%i == 0) {
				div.add(i);
				
				// Add the matching pair as long as i isn't the square root of n.
				if (n/i > i)
					div.add(n/i);
			}
		}
		
		// Sort like they say and print.
		Collections.sort(div);
		for (int i=0; i<div.size(); i++) 
			System.out.println(div.get(i));
	}		
}