# PROBLEM LINK:

* Author:* Riddhish Lichade

*Ram Agrawal*

**Tester:***Riddhish Lichade*

**Editorialist:**# DIFFICULTY:

CAKEWALK

# PREREQUISITES:

None

# PROBLEM:

The third wave of करोना is approaching. In the second wave, Yogesh was a little careless and has suffered. Now, he doesn’t want to take any risk.

He decided to use 2 masks at a time, wearing one over the other. To further reduce the risk, he uses a set of masks not more than one day.

Find the number of masks he will need in N days.

# EXPLANATION:

The problem statement asks the number of masks, Yogesh will require for N days if he uses 2 masks daily.

ans = N*2

# SOLUTIONS:

## Setter's Solution

```
from sys import stdin
for _ in range(int(stdin.readline())):
n=int(stdin.readline())
print(n*2)
```

## Tester's Solution

```
#include <iostream>
using namespace std;
int main() {
int t,n;
cin>>t;
for(int i=1;i<=t;i++)
{
cin>>n;
int ans=n*2;
cout<<ans<<"\n";
}
return 0;
}
```