->n{r=->a{b,c,d=a;b ?a==b ?a-1:a==a-[0]?b:[[b,c,r[d]],c-1,b]:n};(h=[],n,k=1;(k+=1;h=r[h])until h==0)until k>n;k}

class ord:
	def check(val):
		if type(val) == list:
			return all(ord.check(x) for x in val)
		return False
	def le(a, b):
		if a == []:
			return True
		if b == []:
			return False
		if a[0] == b[0]:
			return ord.le(a[1:],b[1:])
		if ord.le(a[0],b[0]):
			return True
		return False
	def str(a):
		if a == []:
			return "1"
		if len(a) == 1:
			return "\u03c9^"+ord.str(a[0])
		return "+".join(ord.str(x) for x in a)
	def __init__(self, *val):
		val = list(val)
		assert(ord.check(val))
		self.val = []

a=ord([],[[]],[])
b=ord([[]],[],[])
print(a)
print(b)
print(a<=b)
print(a<b)

	def __init__(self, *val):
		val = list(val)
		assert(ord.check(val))
		self.val = []
		curr_max = 0
		for a in val:
			if curr_max != 0 and ord.le(a,curr_max):
				self.val.append(curr_max)
				if a != curr_max:
					curr_max = 0
			curr_max = a
		self.val.append(val[-1])