class UnionFind
  def initialize(n)
    @size = Array.new(n, 1)
    @rank = Array.new(n, 0)
    @parent = []

    (0..n).each do |i|
      @parent[i] = i
    end
  end

  def find(x)
    if @parent[x] == x
      x
    else
      @parent[x] = find(@parent[x])
    end
  end

  def unite(x, y)
    x = find(x)
    y = find(y)
    return if x == y

    if @rank[x] < @rank[y]
      @parent[x] = y
      @size[y] += @size[x]
    else
      @parent[y] = x
      @size[x] += @size[y]

      @rank[x] += 1 if @rank[x] == @rank[y]
    end
  end

  def same?(x, y)
    find(x) == find(y)
  end

  def size(x)
    @size[find(x)]
  end
end

N = gets.to_i
P = gets.split.map(&:to_i)

uf = UnionFind.new(N + 1)

P.each.with_index(1) do |v, i|
  uf.unite(v, i)
end

visited = Array.new(N + 1, false)
ans = 0

1.upto(N) do |i|
  x = uf.find(i)
  next if visited[x]
  visited[x] = true

  cnt = uf.size(x)
  ans += (cnt - 1)
end

puts ans