Algorithm

A. Ilya and Bank Account
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/313/problem/A
input
standard input
output
standard output

Ilya is a very clever lion, he lives in an unusual city ZooVille. In this city all the animals have their rights and obligations. Moreover, they even have their own bank accounts. The state of a bank account is an integer. The state of a bank account can be a negative number. This means that the owner of the account owes the bank money.

Ilya the Lion has recently had a birthday, so he got a lot of gifts. One of them (the gift of the main ZooVille bank) is the opportunity to delete the last digit or the digit before last from the state of his bank account no more than once. For example, if the state of Ilya's bank account is -123, then Ilya can delete the last digit and get his account balance equal to -12, also he can remove its digit before last and get the account balance equal to -13. Of course, Ilya is permitted not to use the opportunity to delete a digit from the balance.

Ilya is not very good at math, and that's why he asks you to help him maximize his bank account. Find the maximum state of the bank account that can be obtained using the bank's gift.

Input

The single line contains integer n (10 ≤ |n| ≤ 109) — the state of Ilya's bank account.

Output

In a single line print an integer — the maximum state of the bank account that Ilya can get.

Examples
input
Copy
2230
output
Copy
2230
input
Copy
-10
output
Copy
0
input
Copy
-100003
output
Copy
-10000
Note

In the first test sample Ilya doesn't profit from using the present.

In the second test sample you can delete digit 1 and get the state of the account equal to 0.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <stdio.h>

using namespace std;

int main() {
  int n;
  scanf("%d", &n);
  
  if(n >= 0) {
    printf("%d\n", n);
    return 0;
  }
  
  int n1, n2;
  
  n1 = n / 10;
  n2 = (n1 / 10) * 10 + n % 10;
  
  printf("%d\n", max(n1, n2));
  
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2230

Output

x
–
+
cmd
2230
Advertisements

Demonstration

Codeforces Solution-Ilya and Bank Account-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+