For this Question: Priyanka works for an international toy company that ships by container. Her task is to the determine the lowest cost way to combine her orders for shipping. She has a list of item weights. The shipping company has a requirement that all items loaded in a container must weigh less than or equal to 4 units plus the weight of the minimum weight item. All items meeting that requirement will be shipped in one container.

What is the smallest number of containers that can be contracted to ship the items based on the given list of weights?

See example for better understanding.The first line contains an integer N, the number of orders to ship. 
The next line contains N space- separated integers, w[1], w[2]., w[N] representing the orders in a weight array.

1 <= N <= 100000
1 <= w[i] <= 100000Print the integer value of the number of containers Priyanka must contract to ship all of the toys.Sample Input
9
1 2 3 4 5 10 11 12 13

Sample Output
2

There are items with weights w = [1, 2, 3, 4, 5, 10, 11, 12, 13]. This can be broken into two containers: [1, 2, 3, 4, 5] and [10, 11, 12, 13]. Each container will contain items weighing within 4 units of the minimum weight item., I have written this Solution Code: import sys
N=int(sys.stdin.readline())
a=list(sys.stdin.readline().split())
for index,item in enumerate(a):
    a[index]=int(item)

a=sorted(a)
count=0
i=0
while i<N:
    temp=int(a[i])+4
    count+=1
    while i<N and int(a[i])<=temp:
        i+=1
    
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?