Hacker rank Big Sorting

#!/bin/python3
 
import math
import os
import random
import re
import sys
 
#
# Complete the 'bigSorting' function below.
#
# The function is expected to return a STRING_ARRAY.
# The function accepts STRING_ARRAY unsorted as parameter.
#
 
def bigSorting(unsorted):
    # Write your code here
    unsorted= sorted(unsorted)
    ans=[]
    for i in unsorted:ans.append(str(i))
    return ans
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')
    n = int(input().strip())
    unsorted = []
    for _ in range(n):
        unsorted_item = int(input())
        unsorted.append(unsorted_item)
 
    result = bigSorting(unsorted)
 
    fptr.write('\n'.join(result))
    fptr.write('\n')
 
    fptr.close()