For this Question: Find the lexicographically smallest permutation P of integers from 1 to N such that:
1. It should not be strictly increasing i. e. there must be an i such that P[i] < P[i-1] for 2 <= i <= N
2. Sum of every three consecutive elements should be divisible by 3.The only line of input contains a single integer N, denoting the number of elements in the permutation.

3 <= N <= 15Print a single line containing N space separated integers denoting the elements of the permutation.Sample Input:
4

Sample Output:
1 3 2 4

Explanation:
Some permutations of 4 integers are:
1. [1, 2, 3, 4] - not valid since it is strictly increasing
2. [1, 3, 4, 2] - not valid since sum of [1, 3, 4] is not divisible by 3
3. [4, 3, 2, 1] - not valid because its not lexicographically smallest, I have written this Solution Code: a=int(input())
if a==9:
	print("1 2 3 4 5 9 7 8 6")
elif a==8:
	print("1 2 3 4 8 6 7 5")
elif a==15:
	print("1 2 3 4 5 6 7 8 9 10 11 15 13 14 12")
elif a==14:
	print("1 2 3 4 5 6 7 8 9 10 14 12 13 11")
elif a==13:
	print("1 2 3 4 5 6 7 8 9 13 11 12 10")
elif a==12:
	print("1 2 3 4 5 6 7 8 12 10 11 9")
elif a==11:
	print("1 2 3 4 5 6 7 11 9 10 8")
elif a==10:
	print("1 2 3 4 5 6 10 8 9 7")
elif a==7:
	print("1 2 3 7 5 6 4")
elif a==6:
	print("1 2 6 4 5 3")
elif a==5:
	print("1 5 3 4 2")
elif a==4:
	print("1 3 2 4")
elif a==3:
	print("1 3 2"), In this Programming Language: Python, Now tell me if this Code is compilable or not?