For this Question: You are given an integer n. You have to print an array of n numbers that contains integers from 1 to n exactly once and which is anti-Fibonacci in nature.
Note: Any array P is said to be anti-Fibonacci if it satisfies the following condition P<sub>i-1</sub> + P<sub>i-2</sub> != P<sub>i</sub> where (3 &le; i &le; n).The first line contains one integer n.
<b>Constraints :</b>
3 &le; n &le; 10<sup>5</sup>You have to print n space separated integers. (if there are multiple solution print any of them).Sample Input:-
4
Sample Output:-
2 4 1 3

Sample Input:-
3
Sample Output:-
1 3 2, I have written this Solution Code: #include <iostream>
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int

using namespace std;
void oreo()
{
int n;
cin>>n;

for(int i=n;i>=1;i--)
cout<<i<<" ";
cout<<endl;
}
int main() {
	// your code goes here
		ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
	int t=1;
//	cin>>t;
	while(t--)
	{
	    oreo();
	}
	
	return 0;
}

/*
placement 6 mahina me hai bhai 
ek aur question karlee
*/, In this Programming Language: C++, Now tell me if this Code is compilable or not?