int n;
int tree[100005];
#define lowbit(x) x&(-x)
inline void modify(int x,int d){
	for(;x<=n;x+=lowbit(x))tree[x]+=d;
}
inline int query(int x){
	int ans=0;
	for(;x;x-=lowbit(x))ans+=tree[x];
	return ans;
}