#include <iostream>
#include <algorithm>
#include <cmath>
int solve(int initial, int target) {
    int folds = 0;
    while (initial > target) {
        initial = (initial + 1) / 2; 
        folds++;
    }
    return folds;
}

int minMoves(int h, int w, int ht, int wt) {
    int folds1 = solve(h, ht) + solve(w, wt);
    int folds2 = solve(h, wt) + solve(w, ht); 
    return min(folds1, folds2);
}

class SegmentTree{
public:
    vector<vector<int>> tree;
    SegmentTree(int n){
        tree.resize(n<<2|1);
    }
    vector<int> merge(vector<int> &node1 , vector<int> &node2){
        int n = node1.size() , m = node2.size();
        int i = 0 , j = 0;
        vector<int> newNode;
        while(i < n && j < m){
            if(node1[i] <= node2[j]) newNode.push_back(node1[i++]);
            else newNode.push_back(node2[j++]);
        }
        while(i < n) newNode.push_back(node1[i++]);
        while(j < m) newNode.push_back(node2[j++]);
        return newNode;
    }

    void build(int node , int low , int high , vector<int> &nums){
        if(low == high){
            tree[node].push_back(nums[low]);
            return;
        }
        int mid = low + (high - low)/2;
        build(node << 1 , low , mid , nums);
        build(node << 1 | 1 , mid + 1 , high , nums);
        tree[node] = merge(tree[node<<1] , tree[node<<1|1]);
    }

    int query(int node , int low , int high , int ql , int qr , int k){
        if(low > qr || high < ql) return 0;
        if(low >= ql && high <= qr) return tree[node].size() - (lower_bound(tree[node].begin() , tree[node].end() , k) - tree[node].begin());
        int mid = low + (high - low)/2;
        return query(node << 1 , low , mid , ql , qr , k) + query(node << 1 | 1 , mid + 1 , high , ql , qr , k);
    }
};




vector<int> countNumberOfRetailers(vector<vector<int>> retailers , vector<vector<int>> requests){
    int n = retailers.size();
    sort(retailers.begin() , retailers.end());
    vector<int> x , y , z;
    for(int i = 0 ; i < retailers.size() ; i++){
        x.push_back(retailers[i][0]);
        y.push_back(retailers[i][1]);
    }
    SegmentTree seg(n);
    seg.build(1 , 0 , n - 1 , y);
    for(int i = 0 ; i < requests.size() ; i++){
        int low = 0 , high = n - 1;
        int id = n;
        while(low <= high){
            int mid = (low + high) / 2;
            if(x[low] < requests[i][0]) low = mid + 1;
            else high = mid - 1 , id = mid;
        }
        int cnt = seg.query(1 , 0 , n - 1 , id , n - 1 , requests[i][1]);
        // int cnt = 0;
        // for(int j = id ; j < n ; j++) if(y[j] >= requests[i][i]) cnt++;
        z.push_back(cnt);
    }
    return z;
}

#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
void findCircle(int root, unordered_set<int>& seen, unordered_map<int, vector<int>>& graph) {
    for (int friendVertex : graph[root]) {
        if (!seen.count(friendVertex)) {
            seen.insert(friendVertex);
            findCircle(friendVertex, seen, graph);
        }
    }
}

vector<int> getTheGroups(int n, vector<string> queryType, vector<int> student1, vector<int> student2) {
    vector<int> ans;
    unordered_map<int, vector<int>> graph;

    for (int i = 1; i <= n; i++) {
        graph[i] = vector<int>();
    }

    for (int i = 0; i < queryType.size(); i++) {
        string type = queryType[i];
        int f1 = student1[i];
        int f2 = student2[i];

        if (f1 != f2 && type == "Friend") {
            graph[f1].push_back(f2);
            graph[f2].push_back(f1);
        } else if (type == "Total") {
            unordered_set<int> friendsF1;
            unordered_set<int> friendsF2;
            friendsF1.insert(f1);
            friendsF2.insert(f2);
            findCircle(f1, friendsF1, graph);
            findCircle(f2, friendsF2, graph);

            if (f1 == f2) {
                ans.push_back(friendsF1.size());
            } else if (friendsF1.count(f2)) {
                ans.push_back(friendsF1.size());
            } else {
                ans.push_back(friendsF1.size() + friendsF2.size());
            }
        }
    }

    return ans;
}

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> solve(vector<int>& nums) {
    vector<vector<int>> ans;
    int n = nums.size();
    sort(nums.begin(), nums.end());
    for (int i = 0; i < n - 2; ++i) {
        if (i > 0 && nums[i] == nums[i - 1]) 
        continue;
        int left = i + 1, right = n - 1;
        while (left < right) {
            int sum = nums[i] + nums[left] + nums[right];
            if (sum == 0) {
                ans.push_back({nums[i], nums[left], nums[right]});
                while (left < right && nums[left] == nums[left + 1]) ++left;
                while (left < right && nums[right] == nums[right - 1]) --right;
                ++left;
                --right;
            } else if (sum < 0) {
                ++left;
            } else {
                --right;
            }
        }
    }
    return ans;
}

SELECT 
    a.iban,
    ROUND(SUM(CASE WHEN EXTRACT(QUARTER FROM d.dt) = 1 THEN d.amount ELSE 0 END), 2) AS q1,
    ROUND(SUM(CASE WHEN EXTRACT(QUARTER FROM d.dt) = 2 THEN d.amount ELSE 0 END), 2) AS q2,
    ROUND(SUM(CASE WHEN EXTRACT(QUARTER FROM d.dt) = 3 THEN d.amount ELSE 0 END), 2) AS q3,
    ROUND(SUM(CASE WHEN EXTRACT(QUARTER FROM d.dt) = 4 THEN d.amount ELSE 0 END), 2) AS q4,
    ROUND(SUM(d.amount), 2) AS year2023
FROM 
    accounts a
LEFT JOIN 
    declarations d ON a.id = d.account_id
WHERE 
    EXTRACT(YEAR FROM d.dt) = 2023
GROUP BY 
    a.iban
ORDER BY 
    a.iban ASC;

SELECT 
    c.email,
    COUNT(s.url) AS total_active_sites
FROM 
    customers c
LEFT JOIN 
    sites s ON c.id = s.customer_id AND s.is_active = 1
GROUP BY 
    c.email
ORDER BY 
    c.email ASC;

SELECT 
    u.email,
    COUNT(t.id) AS total_transactions,
    ROUND(SUM(t.amount), 2) AS total_amount
FROM 
    users u
LEFT JOIN 
    transactions t ON u.id = t.user_id
WHERE 
    YEAR(t.dt) = 2023
GROUP BY 
    u.email
ORDER BY 
    u.email ASC;