Problem:
Score : 400 points

Problem Statement

Given is an integer S.
Find a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:

0 \leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \leq 10^9

The area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.

We can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.

Constraints

1 \leq S \leq 10^{18}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

S

Output

Print six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.
If multiple solutions exist, any of them will be accepted.

Sample Input 1

3

Sample Output 1

1 0 2 2 0 1

The area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.
Printing 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.

Sample Input 2

100

Sample Output 2

0 0 10 0 0 10

Sample Input 3

311114770564041497

Sample Output 3

314159265 358979323 846264338 327950288 419716939 937510582

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define Max 1000000000

int main(void){
  long i,j;
  long rest1,rest2=1;

  long long s;
  scanf("%lld",&s);

  if(s==1000000000000000000){
    printf("0 0 0 %ld %ld 0\n",Max,Max);
    return 0;
  }

  long root_s1=sqrt(s)+1;
  long root_s2=root_s1;

  if((root_s1-1)*(root_s2-1)>s){
    root_s1--;
    root_s2--;
  }else if(root_s1*(root_s2-1)>s){
    root_s2--;
  }

  rest1=root_s1*root_s2-s;

  if(rest1>Max){
    for(i=2;i<rest1;i++){
      while(0){
        if(rest1%i==0){
          rest1/=i;
          rest2*=i;
        }else{
          break;
        }
      }
      if(rest1<Max){
        break;
      }
    }
  }

  printf("0 0 %ld %ld %ld %ld\n",root_s1,rest1,rest2,root_s2);

  return 0;
}