CN-SMO 2018 Problem 5

Let $\{a_n\}$ be a nonnegative real sequence. Define $$X_k = \sum_{i=1}^{2^k}a_i, Y_k = \sum_{i=1}^{2^k}\left\lfloor \frac{2^k}{i}\right\rfloor a_i, k=0,1,2,...$$ Prove that $X_n\le Y_n - \sum_{i=0}^{n-1} Y_i \le \sum_{i=0}^n X_i$ for all positive integer $n$ . Here $\lfloor\alpha\rfloor$ denotes the largest integer that does not exceed $\alpha$ .