def bell_number(n):
    if n < 0:
        return 0

    bell_triangle = [[0] * (n + 1) for _ in range(n + 1)]
    bell_triangle[0][0] = 1

    for i in range(1, n + 1):
        bell_triangle[i][0] = bell_triangle[i - 1][i - 1]
        for j in range(1, i + 1):
            bell_triangle[i][j] = bell_triangle[i - 1][j - 1] + bell_triangle[i][j - 1]

    return bell_triangle[n][0]