Solution for swap it problem in C++

swap_it.cpp

#include <iostream>
using namespace std;

int main() {
    int N;
    cin >> N;  // Number if values

    int value;
    int count = 0 ;
    for(int i = 0; i < N; i++){
        cin >> value;    // input sequence
        if(value != i+1){
            count++;  // count if they are not in their position
        }
    }
  // that means their are only two element that are not on their position
  // for one swapping we need only two elements.
    if(count <= 2) {   
        cout << "YES";
    } else {
        cout << "NO";
    }
}