algorithm for finding all divisors of a number

Hello! While solving a problem, I had to find online an algorithm for finding all divisors of a number. That is, for eight it should output [1,2,4,8], not [2,2,2] - a list of divisors. I rewrote this algorithm from scratch, and I ask the "senior comrades" to suggest how to improve it. If you have time ))

def divisorss(n):    from collections import Counter    ls = get_ls(n)                  # for n=1568 -> ls = [2, 2, 2, 2, 2, 7, 7]    pairs = dict(Counter(ls))       #  {2: 5, 7: 2}    from itertools import product, starmap    from operator 

                    

                        

                            
                            
                                1