func_code_string: #include <bits/stdc++.h>   using namespace std;   long long binpow(long long a, long long b) {     long long exp = 10e9;     long long res = 1;     while (b > 0) {       if (b & 1) res = ((res % exp) * (a % exp)) % exp;       a = ((a % exp) * (a % exp)) % exp;       b >>= 1;     }     return res;   }   bool isprime(int x) {     for (int d = 2; d * d <= x; d++) {       if (x % d == 0) return false;     }     return true;   }   unsigned int cntsb(unsigned int n) {     unsigned int count = 0;     while (n) {       count += n & 1;       n >>= 1;     }     return count;   }   void solve(int cas) {}   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     int number = 0;     long long n;     cin >> n;     int last = n % 10;     if (last <= 5)       n -= last;     else       n += (10 - last);     cout << n;   }   