Codeforces Round #371 (Div. 2)

A. Meeting of Old Friends

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!

Sonya is an owl and she sleeps during the day and stay awake from minutel₁ to minuter₁ inclusive. Also, during the minutek she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minutel₂ to minuter₂ inclusive.

Calculate the number of minutes they will be able to spend together.

Input

The only line of the input contains integers l₁, r₁,l₂, r₂ and k (1 ≤ l₁, r₁, l₂, r₂, k ≤ 10¹⁸,l₁ ≤ r₁,l₂ ≤ r₂), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

Output

Print one integer — the number of minutes Sonya and Filya will be able to spend together.

Examples

Input

1 10 9 20 1

Output

2

Input

1 100 50 200 75

Output

50

Note

In the first sample, they will be together during minutes9 and 10.

In the second sample, they will be together from minute50 to minute 74 and from minute76 to minute 100.A

题意：给两个去区间[l1,r1],[l2,r2],问区间交集，如果交集包含K，-1，注意数据范围。

题解：

分两种情况，如果两个区间没有交集。即l1>r2或者l2>r1,输出0，否则，交集的左端点为MAX(L1,L2,），右端点为MIN(R1,R2) 再判断k的位置就好

代码：

<span style="font-size:14px;"><span style="font-size:14px;">#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define LL long long
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
int main()
{
    LL a,b,c,d,e;
    while(cin>>a>>b>>c>>d>>e)
    {
        if(a>d||b<c)
            printf("0");
        else
        {
            LL ans=min(b,d)-max(a,c)+1;
            if(e>=max(a,c)&&e<=min(b,d))
                ans--;
            printf("%I64d\n",ans);
        }
    }
}</span></span>

B. Filya and Homework

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help.

Filya is given an array of non-negative integers a₁, a₂, ..., a_n. First, he pick an integerx and then he adds x to some elements of the array (no more than once), subtract x from some other elements (also, no more than once) and do no change other elements. He wants all elements of the array to be equal.

Now he wonders if it's possible to pick such integerx and change some elements of the array using thisx in order to make all elements equal.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the number of integers in the Filya's array. The second line containsn integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹) — elements of the array.

Output

If it's impossible to make all elements of the array equal using the process given in the problem statement, then print "NO" (without quotes) in the only line of the output. Otherwise print "YES" (without quotes).

Examples

Input

5
1 3 3 2 1

Output

YES

Input

5
1 2 3 4 5

Output

NO

Note

In the first sample Filya should select x = 1, then add it to the first and the last elements of the array and subtract from the second and the third elements.

题意：给你N个数，有两个操作，每个操作至多能用一次，1；数组任意值+x，数组任意值-x、问最后能不能形成一个相等序列，

题解：注意操作的要求，至多有一次，说明可以不进行操作，即给出的序列本身就是相等的，然后判断，区间不同数的个数，如果是1（之前判断了）或2就一定可以，如果是3，三个数需要满足是等差数列，可以用set或者数组都行，我用的是数组、

代码：

<span style="font-size:14px;">#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define LL long long
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
const int N=100100;
int a[N];
int n;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+1+n);
    if(a[1]==a[n])
        printf("YES\n");
    else
    {
        int d=unique(a+1,a+1+n)-a-1;
        if(d<=2)
         printf("YES\n");
        else
        {
            if(d==3)
            {
                int x=a[1];
                int y=a[n];
                int z=*upper_bound(a+1,a+1+n,x);     
                if(2*z==x+y)
                     printf("YES\n");
                else
                    printf("NO\n");
            }
            else
                printf("NO\n");
        }

    }
}</span>

C. Sonya and Queries

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of one of the following type:

1.  +  a_i — add non-negative integer a_i to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer.
2.  -  a_i — delete a single occurrence of non-negative integer a_i from the multiset. It's guaranteed, that there is at least one a_i in the multiset.
3. ? s — count the number of integers in the multiset (with repetitions) that match some pattern s consisting of 0 and 1. In the pattern, 0 stands for the even digits, while 1 stands for the odd. Integer x matches the pattern s, if the parity of the i-th from the right digit in decimal notation matches the i-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with 0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the 0-s from the left.

For example, if the pattern is s = 010, than integers 92, 2212, 50 and 414 match the pattern, while integers 3, 110, 25 and 1030 do not.

Input

The first line of the input contains an integer t (1 ≤ t ≤ 100 000) — the number of operation Sonya has to perform.

Next t lines provide the descriptions of the queries in order they appear in the input file. The i-th row starts with a character c_i — the type of the corresponding operation. If c_i is equal to '+' or '-' then it's followed by a space and an integer a_i (0 ≤ a_i < 10¹⁸) given without leading zeroes (unless it's 0). If c_i equals '?' then it's followed by a space and a sequence of zeroes and onse, giving the pattern of length no more than 18.

It's guaranteed that there will be at least one query of type '?'.

It's guaranteed that any time some integer is removed from the multiset, there will be at least one occurrence of this integer in it.

Output

For each query of the third type print the number of integers matching the given pattern. Each integer is counted as many times, as it appears in the multiset at this moment of time.

Examples

Input

12
+ 1
+ 241
? 1
+ 361
- 241
? 0101
+ 101
? 101
- 101
? 101
+ 4000
? 0

Output

2
1
2
1
1

Input

4
+ 200
+ 200
- 200
? 0

Output

1

Note

Consider the integers matching the patterns from the queries of the third type. Queries are numbered in the order they appear in the input.

1. 1 and 241.
2. 361.
3. 101 and 361.
4. 361.
5. 4000.
   

题意：3种操作，+，-，？。+；往集合里加入一个数，-：从集合中减去一个数，？：问集合中这个数 的个数。注意，把给出的数需要先变形，每一位是奇数就为1，偶数就为0，例；241->001->1.

题解:正确理解题意后，直接模拟，map映射一下。

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    map<int,int> mp;
    string s,c;
    while(t--){
        int x=0;
        cin>>c>>s;
        reverse(s.begin(),s.end());
        for(int i=0;i<s.size();i++)
                if(s[i]&1) x=x|1<<i;
        if(c[0]=='+')
            mp[x]++;
        else if(c[0]=='-')
            mp[x]--;
        else printf("%d\n",mp[x]);
    }
    return 0;
}