# include <bits/stdc++.h>
# define int long long
using namespace std;
void work(int a,int b,int c,int d,int &x,int &y)
{if (a<b&&c>d) { x=1,y=1; return; }if (a*d>b*c) work(c,d,a,b,x,y);else if (a>=b) work(b,a,d,c,y,x);else {int t=d/c;work(a,b-t*a,c,d-t*c,x,y);y+=t*x;}
}
main()
{int T; scanf("%lld",&T);while (T--) {int a,b,c,d; scanf("%lld%lld%lld%lld",&a,&b,&c,&d);int x,y;  if (a*d>b*c) swap(a,c),swap(b,d);work(a,b,c,d,x,y); printf("%lld %lld\n",x,y);}return 0;}

# include <bits/stdc++.h>
using namespace std;
const int N=5e5+10;
struct rec{int pre,to;
}a[N<<1];
int head[N],n,m,q,val[N],tot,col[N];
void adde(int u,int v)
{a[++tot].pre=head[u];a[tot].to=v;head[u]=tot;
}
struct Linear_Basis{int d[31];Linear_Basis() {memset(d,0,sizeof(d));}void insert(int x) {for (int i=30;i>=0;i--)if (x&(1<<i)) {if (!d[i]) { d[i]=x; break;}else x^=d[i];}}int query(int ret) {for (int i=30;i>=0;i--)if ((ret^d[i])>ret) ret^=d[i];return ret; }
}B;
void dfs(int u,int c)
{col[u]=c;for (int i=head[u];i;i=a[i].pre) {int v=a[i].to; if (col[v]) continue;dfs(v,3-c);}
}
int main()
{scanf("%d%d%d",&n,&m,&q);for (int i=1;i<=n;i++) scanf("%d",&val[i]);for (int i=1;i<=m;i++) {int u,v; scanf("%d%d",&u,&v);adde(u,v); adde(v,u);}dfs(1,1);for (int i=1;i<n;i++) B.insert(val[i]^val[i+1]);int same = B.query(val[1]);int diff = B.query(0);while (q--) {int u,v; scanf("%d%d",&u,&v);if (col[u]==col[v]) printf("%d\n",same);else printf("%d\n",diff);}return 0;}

#include<bits/stdc++.h>
#define ll long long
#define inf (1e18)
using namespace std;
struct p{double x,y;}a[200010],s[200010],l,r;
ll n,k=1,top=1,ans;
double cross(p a,p b,p c){return(b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);}
double dis(p a,p b){return sqrt((b.y-a.y)*(b.y-a.y)+(b.x-a.x)*(b.x-a.x));}
bool cmp(p x,p y)
{double tmp=cross(a[1],x,y);return tmp>0||(tmp==0&&dis(a[0],x)<dis(a[0],y));
}
int main()
{scanf("%lld",&n);for(ll i=1;i<=n;i++)scanf("%lf%lf",&a[i].x,&a[i].y),a[i].y-=a[i].x*a[i].x;for(ll i=1;i<=n;i++)if((a[k].y>a[i].y)||(a[k].y==a[i].y&&a[i].x<a[k].x))k=i;swap(a[k],a[1]),sort(a+2,a+1+n,cmp),s[1]=a[1];for(ll i=2;i<=n;i++){while(top>1&&cross(s[top-1],a[i],s[top])>=0)top--;s[++top]=a[i];}l={inf*1.0,inf*1.0},r={inf*-1.0,inf*-1.0};for(ll i=1;i<=top;i++){if(s[i].x<l.x)l=s[i];else if(s[i].x==l.x&&s[i].y>l.y)l=s[i];if(s[i].x>r.x)r=s[i];else if(s[i].x==r.x&&s[i].y>r.y)r=s[i];}for(ll i=1;i<=top;i++)if(cross(l,r,s[i])>0)ans++;printf("%lld\n",ans+1);return 0;
}