{}
def solve_1d():
intervals = []
grid_size = 4
for start in range(grid_size + 1):
for end in range(start + 1, grid_size + 1):
intervals.append((start, end))
n = len(intervals)
intersecting_pairs_1d = 0
total_pairs_1d = n * n
for i1 in intervals:
for i2 in intervals:
start = max(i1[0], i2[0])
end = min(i1[1], i2[1])
length = max(0, end - start)
if length >= 1:
intersecting_pairs_1d += 1
return intersecting_pairs_1d, total_pairs_1d
intersect_1d, total_1d = solve_1d()
print(f"{intersect_1d}")