class Algorithm:

      arr = []

      def __init__(self, arr):

          self.arr = arr

      def run(self):

          n = len(self.arr)

          finished = False        

          while finished == False:

            swapped = False

            for i in range(0, n-1):

                if(self.arr[i] > self.arr[i+1]):

                      self.arr[i], self.arr[i+1] = self.arr[i+1], self.arr[i]

                      swapped = True

            if swapped == True:

               n = n - 1

            else:

               finished = True 


      def get(self):

          return self.arr          


def main():

    f = open("algsort.in", "r")

    arr = []

    for val in f.read().split():

        arr.append(int(val))
 
    f.close()
     
    arr.pop(0)

    ob = Algorithm( arr )

    ob.run()

    out = open('algsort.out','w')

    out.write(" ".join(map(str, ob.get())))     

if __name__ == "__main__":
 
   main();