# https://yukicoder.me/problems/no/3581

import math

class LazySegmentTree:
    """
    非再帰版遅延セグメント木。
    更新は「加法」、取得は「最大値」のもの限定。
    取得のところの都合で取得演算子は可換になっている必要がある。
    """

    def __init__(self, init_array):
        n = 1
        while n < len(init_array):
            n *= 2
        
        self.size = n
        self.array = [[0, 0] for _ in range(2 * self.size)]
        self.lazy_array = [0 for _ in range(2 * self.size)]
        for i, a in enumerate(init_array):
            self.array[self.size + i][0] = 1
        
        end_index = self.size
        start_index = end_index // 2
        while start_index >= 1:
            for i in range(start_index, end_index):
                self._op(self.array[i], self.array[2 * i], self.array[2 * i + 1])
            end_index = start_index
            start_index = end_index // 2
    
    def _op(self, array, left , right):
        for j in range(2):
            array[j] = left[j] + right[j]
    
    def _propagates(self, *ids):
        for i in reversed(ids):
            self._propagate(i)

    def _swap(self, array):
        tmp = array[0]
        array[0] = array[1]
        array[1] = tmp

    def _propagate(self, i):
        v = self.lazy_array[i]
        if v == 0:
            return
        
        if i < self.size:
            self.lazy_array[2 * i] += v
            self.lazy_array[2 * i] %= 2
            self.lazy_array[2 * i + 1] += v
            self.lazy_array[2 * i + 1] %= 2
            self._swap(self.array[2 * i])
            self._swap(self.array[2 * i + 1])
        self.lazy_array[i] = 0

    def _get_target_index(self, l, r):
        L = l + self.size; R = r + self.size
        lm = (L // (L & -L)) >> 1
        rm = (R // (R & -R)) >> 1
        while 0 < L and L < R:
            if R <= rm:
                yield R
            if L <= lm:
                yield L
            L >>= 1; R >>= 1
        while L > 0:
            yield L
            L >>= 1

    def add(self, l, r, x):
        # 2. 区間[l, r)のdata, lazyの値を更新
        L = self.size + l; R = self.size + r
        *ids, = self._get_target_index(l, r)
        self._propagates(*ids)
        while L < R:
            if R & 1:
                R -= 1
                self.lazy_array[R] += x
                self.lazy_array[R] %= 2
                self._swap(self.array[R])
            if L & 1:
                self.lazy_array[L] += x
                self.lazy_array[L] %= 2
                self._swap(self.array[L])
                L += 1
            L >>= 1; R >>= 1

        # 3. 伝搬させた区間について、ボトムアップにdataの値を伝搬する
        for i in ids:
            if i < self.size:
                self._op(self.array[i], self.array[2 * i], self.array[2 * i + 1])

    def get_max(self, l, r):
        # 1. トップダウンにlazyの値を伝搬
        self._propagates(*self._get_target_index(l, r))
        L = self.size + l; R = self.size + r

        # 2. 区間[l, r)の最大値を求める
        s = [0, 0]
        while L < R:
            if R & 1:
                R -= 1
                self._op(s, s, self.array[R])
            if L & 1:
                self._op(s, s, self.array[L])
                L += 1
            L >>= 1; R >>= 1
        return s


def main():
    Q = int(input())
    ilr = []
    max_q = 0
    for _ in range(Q):
        i, L, R = map(int, input().split())
        max_q = max(max_q, R + 1, i + 1)
        ilr.append((i, L, R))

    lazy_seg_tree = LazySegmentTree([0] * max_q)
    for i, L, R in ilr:
        sqrt_i = int(math.sqrt(i))

        lazy_seg_tree.add(1, sqrt_i + 1, 1)
        for l in range(1, sqrt_i + 1):
            d = i // l
            if not 1 <= d <= sqrt_i:
                lazy_seg_tree.add(d, d + 1, 1)
        
        s = lazy_seg_tree.get_max(L, R + 1)
        print(s[1])

    









if __name__ == "__main__":
    main()