#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

template <typename T>
void bubble_sort(vector<T> arr, bool ascending) {
    for (int i = 0; i < arr.size() - 1; i++)
        for (int j = 0; j < arr.size() - i - 1; j++)
            if (arr[j] > arr[j+1])
                swap(&arr[j], &arr[i]);

    if (ascending)
        reverse(arr.begin(), arr.end());
}

template <typename T>
class Number {
public:
    T real;
    T imaginary;
private:
    bool operator<(const Number& other) {
        return tie(this->real, this->imaginary) < tie(other.real, other.imaginary);
    }
};

int main() {

    return 0;
}