Observing Frogs

View as PDF

Submit solution

Points: 5 (partial)
Time limit: 0.1s
Java 0.3s
Memory limit: 16M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Lyestria is observing a group of N frogs. The frogs are numbered from 1 to N.

The frog numbered i conveniently lives at the point i. On this day, the frog numbered i wants to go to the point N-i+1, where all the points are equally spaced.

Lyestria then asks you to compute the sum of the distances each frog must travel to get to their desired location.


1 \le N \le 10^9

Input Specification

The first line contains one integer, N, the number of frogs.

Output Specification

On one line, output one integer, the sum of the distances each frog must travel to get home.

Sample Input


Sample Output


Sample Input 2


Sample Output 2



There are no comments at the moment.