def stringOperation(start, fin):
    n, m = len(start), len(fin)
    res = []
    for s in fin:
        found = False
        for t in start:
            if len(s) == len(t) and sum(a != b for a, b in zip(s, t)) == 1:
                found = True
                break
        res.append("YES" if found else "NO")
    return res

vector<int> solution(vector<int> numbers) {
    if (numbers.size() < 2) return numbers;
    
    vector<int> f = {numbers[0]}, s = {numbers[1]};
    
    for (int i = 2; i < numbers.size(); ++i) {
        int cf = 0, cs = 0;
        for (int x : f) cf += x > numbers[i];
        for (int x : s) cs += x > numbers[i];
        
        if (cf > cs || (cf == cs && f.size() <= s.size())) {
            f.push_back(numbers[i]);
        } else {
            s.push_back(numbers[i]);
        }
    }
    
    f.insert(f.end(), s.begin(), s.end());
    return f;
}

import math
def b(x):
    s = int(math.sqrt(x))
    return s * s == x
def solve(A):
    n = len(A)
    y = 0
    for i in range(n):
        for j in range(i + 1, n):
            while b(A[i] * A[j]):
                if A[i] > 1:
                    A[i] += 1
                    y += 1
                elif A[j] > 1:
                    A[j] += 1
                    y += 1
                else:
                    A[i] += 1
                    y += 1
    return y

def go(bubbles, col, row):
    n = len(bubbles)
    row = min(row, n - 1)
    t = row
    for i in range(row, -1, -1):
        if bubbles[i][col] != 0:
            bubbles[t][col] = bubbles[i][col]
            t -= 1
    for i in range(t, -1, -1):
        bubbles[i][col] = 0
def solution(bubbles):
    m, n = len(bubbles), len(bubbles[0])
    dx, dy = [-1, 0, 1, 0], [0, 1, 0, -1]
    to_explode = set()
    for x in range(m):
        for y in range(n):
            if bubbles[x][y] == 0:
                continue
            c = 0
            color = bubbles[x][y]
            for d in range(4):
                xx, yy = x + dx[d], y + dy[d]
                if 0 <= xx < m and 0 <= yy < n and bubbles[xx][yy] == color:
                    c += 1
            if c >= 2:
                to_explode.add((x, y))
                for d in range(4):
                    xx, yy = x + dx[d], y + dy[d]
                    if 0 <= xx < m and 0 <= yy < n and bubbles[xx][yy] == color:
                        to_explode.add((xx, yy))
    for x, y in to_explode:
        bubbles[x][y] = 0
    for y in range(n):
        go(bubbles, y, m - 1)
    return bubbles

long maxScoreAfterKOperations(vector<int>& arr, int k) {
    priority_queue<int> maxHeap(arr.begin(), arr.end());
    long q = 0;
    for (int i = 0; i < k; ++i) {
        long maxElement = maxHeap.top();
        maxHeap.pop();
        q += maxElement;
        long newElement = ceil(maxElement / 3.0);
        maxHeap.push(newElement);
    }
    return q;
}

def longestEvenSumSubsequence(arr):
    n = len(arr)
    arr.sort()
    s = 0
    for i in range(1, n):
        s += arr[i] - arr[i - 1]
    if s % 2 == 0:
        return n 
    else:
        for i in range(n):
            f = s - arr[i] + arr[i - 1] if i > 0 else s - arr[1] + arr[0]
            if f % 2 == 0:
                return n - 1 
    return 0