#include<bits/stdc++.h>
using namespace  std;
int main()
{
	int a,n;
	cin>>n;
	a=n/111;
	if(n%111)	a++;
	cout<<a*111;
}
### Prompt

Develop a solution in cpp to the problem described below:

Kurohashi has never participated in AtCoder Beginner Contest (ABC).

The next ABC to be held is ABC N (the N-th ABC ever held). Kurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.

What is the earliest ABC where Kurohashi can make his debut?

Constraints

* 100 \leq N \leq 999
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

If the earliest ABC where Kurohashi can make his debut is ABC n, print n.

Examples

Input

111


Output

111


Input

112


Output

222


Input

750


Output

777

### Response

```cpp
#include<bits/stdc++.h>
using namespace  std;
int main()
{
	int a,n;
	cin>>n;
	a=n/111;
	if(n%111)	a++;
	cout<<a*111;
}
```