#include using namespace std; #define ll long long #define pll pair #define pii pair #define fs first #define sc second const int mxn = 2e5+10; int dsu[mxn],sz[mxn]; int root(int k){ return k == dsu[k]?k:dsu[k] = root(dsu[k]); } inline void onion(int a,int b){ a = root(a),b = root(b); if(a == b)return; if(sz[a]>n>>m; for(int i = 1;i<=n*2;i++){ dsu[i] = i; sz[i] = 1; } for(int i = 0;i>a>>b; onion(a,b); } ll ans = n; for(int i = 1;i<=n*2;i++){ if(i == dsu[i])ans -= sz[i]/2; } cout<