using System;

using System.Collections.Generic;

//Print all divisors of a number                    

public class Program

{

    public static void PrintDivisorsBigOLogN(int n)

    {

    for(int i =1 ;i<=n;i++)

    {

        if(n%i==0)

        {

            Console.WriteLine(i);

        }

    }

   }

    public static void PrintDivisorsBigOSquareRoot(int n)

    {

        List<int> divisors = new List<int>();

        //The loop runs from i = 1 to i * i <= n, meaning i goes up to √n. It means it is O(square root) times 

        for(int i = 1; i*i<=n; i++) //O (sqrt)

        {

            //All these operations inside loop is following unit 1 or o(1) complexity

            //which is negligible while computing complexity

            if(n%i==0)

            {

                divisors.Add(i);

                if(n/i != i)

                divisors.Add(n/i);

            }

        }

        divisors.Sort(); // O (n log n) since default sort method takes n log n time (quick sort) 

        foreach(int n1 in divisors) // O ( number of factors) and maximum factors of a number can be 2 * square root of n

        {

            Console.WriteLine(n1);

        }

        //Total Time complexity is O(square root) * 

    }

    public static void Main()

    {

        int number;

        Console.WriteLine("Enter a number");

        number = Convert.ToInt32(Console.ReadLine());

        PrintDivisors(number);

    }

}