All submissions for this problem are available.
In the New Era of Pirates, the Pirates are ranked by the Marines according to their notorious activities. More the rank, more dangerous is the pirate (Rank 0 means least dangerous).
The bounties of the pirates are decided on the basis of their rank. Higher the rank, higher is their bounty.
Sengoku, the Fleet Admiral is very fond of series so he decides to set bounties of the pirates according to a series.
Some of the bounties of pirates according to their ranks are as follows:
Rank 1: 4000 beri
Rank 2: 6000 beri
Rank 3: 9000 beri
Rank 4: 12000 beri
Rank 5: 15000 beri
And so on…
*beri is their monetary unit.
Since there are many pirates, in this world, Sengoku is having a hard time computing their bounties so he is asking you for your help. All you have to do is, given a rank, compute the corresponding bounty.
The first line of the input contains a single integer T, denoting the number of test cases. The following T lines contains a single integer R, denoting the rank of the pirate.
For each test case output a single line containing the bounty of the given rank.
Should contain all the constraints on the input data that you may have. Format it like:
- 1 ≤ T ≤ 1000
- 0 ≤ R ≤ 100000
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, GO, PYP3|
Fetching successful submissions
If you are still having problems, see a sample solution here.