Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=[0]*N

for i in range(1,N):
    if i**2 >=N:
        break
    for j in range(1,N):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,N):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=[0]*N

for i in range(1,N):
    for j in range(1,N):
        for k in range(1,N):
            if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=0
for i in range(1,N+1):
    for j in range(1,N):
        if i <=j**2:
            break
        for k in range(1,N):
            if i <=j**2+k**2+j*k:
                break
            for l in range(1,N):
                if i <j**2+k**2+l**2+j*k+k*l+l*j:
                    break
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ans=0
for i in range(1,N+1):
    for j in range(1,N):
        if i <=j:
            break
        for k in range(1,N):
            if i <=k or i<= k+j:
                break
            for l in range(1,N):
                if i <=l or i < k+j+l:
                    break
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=0
for i in range(1,N+1):
    for j in range(1,N):
        if i <=j:
            continue
        for k in range(1,N):
            if i <=k or i<= k+j:
                continue
            for l in range(1,N):
                if i <=l or i < k+j+l:
                    continue
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=0
for i in range(1,N+1):
    for j in range(1,N):
        if i <j:
            continue
        for k in range(1,N):
            if i <k:
                continue
            for l in range(1,N):
                if i <l:
                    continue
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=0
for i in range(1,N+1):
    for j in range(1,N):
        if i <j:
            continue
        for k in range(1,N):
            if i <j+k:
                continue
            for l in range(1,N):
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

ans=0
for i in range(1,N+1):
    for j in range(1,N):
        for k in range(1,N):
            for l in range(1,N):
                if l**2+j**2+k**2+l*j+j*k+k*l==i:
                    ans+=1
    print(ans)
    ans=0

Fixed submission:
N=int(input())

ans=[0]*N

for i in range(1,int(N**0.5)):
    if i**2 >=N:
        break
    for j in range(1,int(N**0.5)):
            if i**2+j**2+i*j>=N:
                break
            for k in range(1,int(N**0.5)):
                    if i**2+j**2+k**2+i*j+j*k+k*i <=N:
                        ans[i**2+j**2+k**2+i*j+j*k+k*i-1] +=1

for i in range(N):
    print(ans[i])