Given coordinates of \'n\' rectangles write a Python Code to find the largest possible rectangular chains that can be formed with these rectangles. There should be at le
