#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
    #define dbg(x) cerr << #x << " : " << x << '\n'
    const int maxn = 20;
#else
    #define dbg(x)
    const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct Tree {
    vector<int> t, assign;
    int size = 0, capacity;

    Tree (vector<int>& v) {
        while ((1<<size) < sz (v)) ++size;
        ++size;
        size = (1<<size);
        capacity = (size>>1);
        t = vector<int> (size);
        assign = vector<int> (size, -1);
        fr (i, sz (v)) t[i + capacity] = v[i];
        for (int i = capacity - 1; i > 0; --i) t[i] = t[i * 2] + t[i * 2 + 1];
    }

    void push (int cur) {
        if (assign[cur] == -1) return;
        assign[cur * 2] = assign[cur * 2 + 1] = assign[cur];
        assign[cur] = -1;
    }

    void render (int cur, int L) {
        int a, b;
        L /= 2;
        if (assign[cur * 2] != -1) a = assign[cur * 2] * L;
        else a = t[cur * 2];
        if (assign[cur * 2 + 1] != -1) b = assign[cur * 2 + 1] * L;
        else b = t[cur * 2 + 1];
        t[cur] = a + b;
    }

    int get (int cur, int left, int right, int l, int r) {
        if (cur >= size) return 0;
        else if (left > r || right < l) return 0;
        else if (l <= left && r >= right) {
            if (assign[cur] != -1) return assign[cur] * (left - right + 1);
            else return t[cur];
        } else {
            push (cur);
            int ans = get (cur * 2, left, (left + right) / 2, l, r) + get (cur * 2 + 1, (left + right) / 2 + 1, right, l, r);
            render (cur, right - left + 1);
            return ans;
        }
    }


    int get (int l, int r) {
        return get (1, 0, capacity - 1, l, r);
    }

    void set (int cur, int left, int right, int l, int r, int x) {
        if (cur >= size) return;
        else if (left > r || right < l) return;
        else if (l <= left && r >= right) assign[cur] = x;
        else {
            push (cur);
            set (cur * 2, left, (left + right) / 2, l, r, x), set (cur * 2 + 1, (left + right) / 2  + 1, right, l, r, x);
            render (cur, right - left + 1);
        }
    }

    void set (int l, int r, int x) {
        set (1, 0, capacity, l, r, x);
    }

};


signed main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);








}