Submit solution

Points:
3

Time limit:
2.0s

Memory limit:
256M

Author:

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

##### 2017 Winter Waterloo Local ACM Contest, Problem A

Vera owns tops and pants. The -th top and -th pants have colour , for , where all 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

- is integer

#### Input Specification

The input will be in the format:

#### 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