TOJ Open Ural FU Championship 2013 A

 

1981. Parallel and Perpendicular

Time limit: 0.5 second
Memory limit: 64 MB

 

You are given a regular n-gon. Your task is to calculate two values: the number of its diagonals that are parallel to at least one of its other diagonals, and the number of its diagonals that are perpendicular to at least one of its diagonals. A diagonal is a segment connecting two non-adjacent polygon vertices.

Input

The only line contains an integer n (4 ≤ n ≤ 10⁵).

Output

Output two required numbers.

Sample

input	output
4	0 2

Problem Author: Grigory Nazarov

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 5005
#define ll long long
#define INF 0x7fffffff
#define eps 1e-8
ll n,m;
int main(){
    while (~scanf("%I64d", &n)){
        ll  x = 0, y = 0;
        x = (n - 3)*n / 2;
        if (n == 6)y = 6;
        if (n == 5)x = 0, y = 0;
        if (n <= 6){printf("%I64d %I64d\n", y, x); continue;}
        if(n&1)printf("%I64d 0\n", x);
        else printf("%I64d %I64d\n",x, x);
    }
    return 0;
}