def To_minswaps(n, arr):
    swaps = []
    pos = [0] * n
    #防止在寻找循环时重复访问同一个元素
    v = [False] * n

    # 初始化位置数组
    for i in range(n):
        pos[arr[i] - 1] = i

    # 找到每个循环并执行交换
    for i in range(n):
        if not v[i]:
            cycle = []
            x = i
            while not v[x]:
                v[x] = True
                cycle.append(x)
                x = pos[x]
            if len(cycle) > 1:
                start = cycle[0] + 1
                end = cycle[-1] + 1
                swaps.append((start, end, start, end))
    return swaps

n = int(input())
arr = list(map(int, input().split()))
swaps = To_minswaps(n, arr)
print(len(swaps))
for swap in swaps:
    print(' '.join(map(str, swap)))