Swap Operations for Sorted Squares

You are given a positive integer N. Consider the array of squares of integers from 1 to N, i.e., [1², 2², ..., N²]. This array is always sorted in non-decreasing order.

Your task is to determine the number of swap operations required to sort the array. Since the array is inherently sorted, the answer will always be 0.

Read the input from stdin and write the result to stdout.

inputFormat

An integer N provided via stdin.

outputFormat

A single integer 0 which is the number of operations required, output to stdout.

3

0