If n is odd then every set will contain 2 adjacent element except the last set which will have last three elements
for i in range ( 0 , int ( n / 2 ) - 1 ) : NEW_LINE INDENT firstadj = 2 * i + 1 ; NEW_LINE secadj = 2 * i + 2 ; NEW_LINE print ( " ( " , firstadj , " , ▁ " , secadj , " ) " ) ; NEW_LINE DEDENT