#include <iostream>

using namespace std;

​

int main() {

    cout << "Welcome to the Introduction to Fenwick Trees!" << endl;

    // Explain the concept and motivation behind Fenwick Trees

    cout << "Fenwick Trees, also known as Binary Indexed Trees, are a data structure that efficiently supports prefix sum queries. They are often used to solve problems that involve range queries, such as finding the sum of elements in a given range." << endl;

    return 0;

}