输入一个数，找出1到它之间所有数出栈的所有情况

counhc=int(input())
#nstr=input()

def fun(ins):
    outsl=[]
    if(len(ins)==0):
        return outsl
    if(len(ins)==1):
        outsl.append(ins[0])
        return outsl
    if(len(ins)==2):
        outsl.append(ins[0]+ins[1])
        outsl.append(ins[1]+ins[0])
        return outsl
    i=0
    while(i