AE00  Rectangles
Byteman has a collection of N squares with side 1. How many different rectangles can he form using these squares?
Two rectangles are considered different if none of them can be rotated and moved to obtain the second one. During rectangle construction, Byteman can neither deform the squares nor put any squares upon any other ones.
Input
The first and only line of the standard input contains one integer N (1 <= N <= 10000).
Output
The first and only line of the standard output should contain a single integer equal to the number of different rectangles that Byteman can form using his squares.
Example
For the input data:
6
the correct result is:
8
Task author: Jakub Radoszewski.
hide comments
cabbie:
20180511 21:18:44
AC in no go


ramesh_961:
20180509 12:38:10
easy,AC in one go !Just think about factors 

rohitistaken:
20180418 16:35:40
AC in one go!!! 

vritta:
20180329 18:06:34
Last edit: 20180329 21:15:55 

vritta:
20180329 18:05:56
Last edit: 20180329 21:16:11 

sarthak_8:
20180319 21:58:48
Cakewalk. Don't forget for n = 1, else WA :P 

badasshackme:
20180310 14:20:13
it took me 30 minutes to realize that YOU MUST NOT ADD NEW LINE SYMBOL AT THE END OF OUTPUT, OR YOUR ABSOLUTELY CORRECT RESULT WILL BE REPORTED AS WRONG. Sorry for caps, it is annoying when you solved problem mathematically and some random new line rule ruins it. 

pigpork:
20180308 13:47:40
AC IN ONE GO! 

richardks3647:
20180224 08:05:40
AC in one go! Last edit: 20180303 06:57:22 

dheerajdheeru:
20180222 02:42:11
AC in one go

Added by:  Race with time 
Date:  20090503 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Algorithmic Engagements 2009 