void separateNumbers(string s) {
    long long number, next;
    string new_string;
    bool possible = false;
    // try to build the beautiful string starting with the first number, if it's not possible increase the number of digits and try again
    for (int digits = 1; digits <= s.size()/2; digits++) {
        // get the first number with the current number of digits from the string given
        // also keep the number for later to print if it's good
        number = stoll(s.substr (0, digits));
        // get the next number, for beautiful condition
        next = number + 1;
        // concatenate numbers with the next beautiful number until the minimum length is achieved
        new_string = s.substr(0, digits) + to_string(next);
        while (new_string.size() < s.size()) {
            next++;
            new_string += to_string(next);
        }
        // if the length is equal and the number is the same, it's possible
        if (new_string.size() == s.size() && new_string == s) {
            possible = true;
            // early exit, no need to continue checking
            break;
        }
    }
    // print result
    if (possible) {
        cout<<"YES "<<number<<endl;
    } else {
        cout<<"NO"<<endl;
    }
}

*for i in range(1, len(s) // 2 + 1):  # Try every possible length for firstnum
    firstnum = int(s[:i])           # Guess the first number
    nextnum = firstnum + 1         # The next expected number in sequence
    temp = s[:i]                     # Start building the sequence from firstnum*

*
    while len(temp) < len(s):        # While our built string is shorter than the original
        temp += str(nextnum)        # Append the next number
        nextnum += 1                # Move to the next*

*    if temp == s:
        print("YES", firstnum)
        return
*