s=input()
a=s.split('.')
if a[0][-1]=='9':
print("GOTO Vasilisa.")
else:
if int(a[1][0]) > 4:
print(int(a[0])+1)
else:
print(int(a[0]))#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.size();
int dot = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '.') {
dot = i;
break;
}
}
if (str[dot - 1] == '9') {
cout << "GOTO Vasilisa.";
return 0;
}
if (str[dot + 1] == '5' || str[dot + 1] == '6' || str[dot + 1] == '7' ||
str[dot + 1] == '8' || str[dot + 1] == '9') {
str[dot - 1] += 1;
}
for (int i = 0; i < dot; i++) {
cout << str[i];
}
}1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |