Buggy python submission (verdict: Runtime Error):
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Fixed submission:
import math
n=int(input())
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Buggy python submission (verdict: Runtime Error):
import math
n=int(input())

x1,y1=0,0
x2,y2=10**9,1
end = n%x2

for x3 in range(1,end+1):
    y3 = (n+x3)/x2
    if float.is_integer(y3):
        x3 =  x2*y3 -n
        break
        
output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Fixed submission:
import math
n=int(input())
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Buggy python submission (verdict: Runtime Error):
import math
n=int(input())

x,y=0,0
maxs=10**9
start = n%(10**8) if n>maxs else 1

for i in range(start, int(n**0.5)+1,2):
    if n % i == 0:
        if maxs>=i and maxs>=(n//i):
            x=i
            y=n//i
            break
print("0 0 0 "+str(x)+" "+str(y)+" 0")

Fixed submission:
import math
n=int(input())
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Buggy python submission (verdict: Time Limit Exceeded):
import math
n=int(input())

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

def check(x,y):
    if float.is_integer(math.sqrt(x)) and float.is_integer(math.sqrt(y)):
        return True

x,y=0,0
maxs=10**9
for i in range(1, int(n**0.5)+1):
    if n % i == 0:
        if maxs>=i and maxs>=n//i:
            x=i
            y=n//i
            break
print("0 0 0 "+str(x)+" "+str(y)+" 0")

Fixed submission:
import math
n=int(input())
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))

Buggy python submission (verdict: Time Limit Exceeded):
import math
n=int(input())

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

def check(x,y):
    if float.is_integer(math.sqrt(x)) and float.is_integer(math.sqrt(y)):
        return True

x,y=0,0
for i in range(1, int(n**0.5)+1):
    if n % i == 0:
        x=i
        y=n//i
print("0 0 0 "+str(x)+" "+str(y)+" 0")

Fixed submission:
import math
n=int(input())
x1,y1=0,0
x2,y2=10**9,1
y3 = n//x2 +1
if y3>x2:
    y3=x2
x3 = y3*x2 - n


output=[x1,y1,x2,y2,x3,y3]
output=list(map(str,output))
    
print(" ".join(output))