v = int(input())
res = 1 if v != 2 else 2
print(res)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define llu unsigned long long
#define int long long
const int M = 1e9+7;
#define all(x) (x).begin(),(x).end()
#define sbit(num, n) num|= (1 << n)
#define fbit(num, n) num^= (1 << n)
#define ubit(num, n) num&= ~(1 << n)
#define ifsbit(num, i) (num & ( 1 << i ) !=0 ) ? true : false
#define clrlsb(num, i) num = (num & (~((1 << (i + 1)) - 1)))
#define clrmsb(num, i) num = (num &((1 << (i + 1)) - 1))
void tcase()
{
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
cin>>a;
if(a==2)
{
cout<<2<<endl;
}
else cout<<1<<endl;
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.\n";
}
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |
1704. Determine if String Halves Are Alike | 1732. Find the Highest Altitude |
709. To Lower Case | 1688. Count of Matches in Tournament |
1684. Count the Number of Consistent Strings | 1588. Sum of All Odd Length Subarrays |
1662. Check If Two String Arrays are Equivalent | 1832. Check if the Sentence Is Pangram |
1678. Goal Parser Interpretation | 1389. Create Target Array in the Given Order |
1313. Decompress Run-Length Encoded List | 1281. Subtract the Product and Sum of Digits of an Integer |
1342. Number of Steps to Reduce a Number to Zero | 1528. Shuffle String |
1365. How Many Numbers Are Smaller Than the Current Number | 771. Jewels and Stones |
1512. Number of Good Pairs | 672. Richest Customer Wealth |
1470. Shuffle the Array | 1431. Kids With the Greatest Number of Candies |