Vera and Outfits

View as PDF

Submit solution

Points: 3
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type
2017 Winter Waterloo Local ACM Contest, Problem A

Vera owns N tops and N pants. The i-th top and i-th pants have colour i, for 1 \le i \le N, where all N colors are different from each other.

An outfit consists of one top and one pants. Vera likes outfits where the top and pants are not the same colour.

How many different outfits does she like?

Constraints

  • 1 \le N \le 2017
  • N is integer

Input Specification

The input will be in the format:

N

Output Specification

Output one line with the number of different outfits Vera likes.

Sample Input 1

1

Sample Output 1

0

Sample Input 2

2

Sample Output 2

2

Sample Input 3

5

Sample Output 3

20

Comments

There are no comments at the moment.