Puzzle

아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제

Andrew is going to open his own factory for manufacturing puzzle pieces. He needs to order a special device that would cut pieces out of cardboard sheets. Also he needs to order a set of tips for it. Each tip allows to cut pieces of a particular form.

A puzzle piece is a square, each of its four sides can contain a rounded tab, a blank cut, or be smooth. The pieces can be of three different types:

  • <<Corners>> --- such pieces have exactly two adjacent smooth sides forming a corner;
  • <<Borders>> --- such pieces have exactly one smooth side;
  • <<Normal>> --- such pieces have no smooth sides.

Rounded tabs and blank cuts can each be of kk types. So, there are 2k+12k+1 options for a puzzle piece side --- rounded tab of one of kk types, blank cut of one of kk types, a smooth side.

Andrew needs to find out how many different tips he need to order. Pieces, such that one of them can be rotated to become equal to another one, can obviously be cut out using the same tip.

Help Andrew to find the number of different tips he needs to order so that he would be able to cut any possible puzzle piece.

입력

The only line of input contains an integer kk --- the number of different rounded tabs and blank cuts types (1k1041 \le k \le 10^4).

출력

Output the number of different tips Andrew need to order.

힌트

All 1818 tips for k=1k = 1 are presented at the picture below: