

#参考https://qiita.com/takayg1/items/c811bd07c21923d7ec69



#####segfunc#####

def segfunc(x, y):

    return max(x,y)

#################



#####ide_ele初期値#####

ide_ele = 0

#################



class SegTree:

    """

    init(init_val, ide_ele): 配列init_valで初期化 O(N)

    update(k, x): k番目の値をxに更新 O(logN)

    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)

    """

    def __init__(self, init_val, segfunc, ide_ele):

        """

        init_val: 配列の初期値

        segfunc: 区間にしたい操作

        ide_ele: 単位元

        n: 要素数

        num: n以上の最小の2のべき乗

        tree: セグメント木(1-index)

        """

        n = len(init_val)

        self.segfunc = segfunc

        self.ide_ele = ide_ele

        self.num = 1 << (n - 1).bit_length()

        self.tree = [ide_ele] * 2 * self.num

        # 配列の値を葉にセット

        for i in range(n):

            self.tree[self.num + i] = init_val[i]

        # 構築していく

        for i in range(self.num - 1, 0, -1):

            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])



    def update(self, k, x):

        """

        k番目の値をxに更新

        k: index(0-index)

        x: update value

        """

        k += self.num

        self.tree[k] = x

        while k > 1:

            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])

            k >>= 1



    def query(self, l, r):

        """

        [l, r)のsegfuncしたものを得る ※区間注意

        l: index(0-index)

        r: index(0-index)

        """

        res = self.ide_ele



        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                res = self.segfunc(res, self.tree[l])

                l += 1

            if r & 1:

                res = self.segfunc(res, self.tree[r - 1])

            l >>= 1

            r >>= 1

        return res



N, K = list(map(int, input().split()))

A = [int(eval(input())) for _ in range(N)]

seg = SegTree([0 for i in range(300050)], segfunc, ide_ele)



answer = 0

for i in range(N):

    

    under = max(0,A[i]-K)

    upper = min(300050,A[i]+K)

    now = seg.query(under, upper+1)

    seg.update(A[i], now+1)

    if answer < now+1:

        answer = now+1

print(answer)
#参考https://qiita.com/takayg1/items/c811bd07c21923d7ec69



#####segfunc#####

def segfunc(x, y):

    return max(x,y)

#################



#####ide_ele初期値#####

ide_ele = 0

#################



class SegTree:

    """

    init(init_val, ide_ele): 配列init_valで初期化 O(N)

    update(k, x): k番目の値をxに更新 O(logN)

    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)

    """

    def __init__(self, init_val, segfunc, ide_ele):

        """

        init_val: 配列の初期値

        segfunc: 区間にしたい操作

        ide_ele: 単位元

        n: 要素数

        num: n以上の最小の2のべき乗

        tree: セグメント木(1-index)

        """

        n = len(init_val)

        self.segfunc = segfunc

        self.ide_ele = ide_ele

        self.num = 1 << (n - 1).bit_length()

        self.tree = [ide_ele] * 2 * self.num

        # 配列の値を葉にセット

        for i in range(n):

            self.tree[self.num + i] = init_val[i]

        # 構築していく

        for i in range(self.num - 1, 0, -1):

            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])



    def update(self, k, x):

        """

        k番目の値をxに更新

        k: index(0-index)

        x: update value

        """

        k += self.num

        self.tree[k] = x

        while k > 1:

            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])

            k >>= 1



    def query(self, l, r):

        """

        [l, r)のsegfuncしたものを得る ※区間注意

        l: index(0-index)

        r: index(0-index)

        """

        res = self.ide_ele



        l += self.num

        r += self.num

        while l < r:

            if l & 1:

                res = self.segfunc(res, self.tree[l])

                l += 1

            if r & 1:

                res = self.segfunc(res, self.tree[r - 1])

            l >>= 1

            r >>= 1

        return res



N, K = list(map(int, input().split()))

A = [int(eval(input())) for _ in range(N)]

seg = SegTree([0 for i in range(300050)], segfunc, ide_ele)



answer = 0

for i in range(N):

    

    under = max(0,A[i]-K)

    upper = min(300050,A[i]+K)

    now = seg.query(under, upper+1)

    seg.update(A[i], now+1)

    

print((seg.query(0,300001)))
# 参考https://qiita.com/takayg1/items/c811bd07c21923d7ec69
#####segfunc#####
def segfunc(x, y):
    return max(x, y)


#################
#####ide_ele初期値#####
ide_ele = 0
#################
class SegTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    update(k, x): k番目の値をxに更新 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        n: 要素数
        num: n以上の最小の2のべき乗
        tree: セグメント木(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新
        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る ※区間注意
        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res


N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
seg = SegTree([0 for i in range(300050)], segfunc, ide_ele)
answer = 0
for i in range(N):
    under = max(0, A[i] - K)
    upper = min(300050, A[i] + K)
    now = seg.query(under, upper + 1)
    seg.update(A[i], now + 1)
    if answer < now + 1:
        answer = now + 1
print(answer)

# 参考https://qiita.com/takayg1/items/c811bd07c21923d7ec69
#####segfunc#####
def segfunc(x, y):
    return max(x, y)


#################
#####ide_ele初期値#####
ide_ele = 0
#################
class SegTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    update(k, x): k番目の値をxに更新 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        n: 要素数
        num: n以上の最小の2のべき乗
        tree: セグメント木(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新
        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る ※区間注意
        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res


N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
seg = SegTree([0 for i in range(300050)], segfunc, ide_ele)
answer = 0
for i in range(N):
    under = max(0, A[i] - K)
    upper = min(300050, A[i] + K)
    now = seg.query(under, upper + 1)
    seg.update(A[i], now + 1)
print((seg.query(0, 300001)))

-    if answer < now + 1: -        answer = now + 1 -print(answer) +print((seg.query(0, 300001)))