跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1379. XOR Equation

  • ID: 1385
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 动态规划
  • 数学
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

XOR Equation

题目描述

A. XOR Equation
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Two positive integers a and b have a sum of s and a bitwise XOR of x. How many possible values are there for the ordered pair (a,b)?

Input

The first line of the input contains two integers s and x (2≤s≤1012, 0≤x≤1012), the sum and bitwise xor of the pair of positive integers, respectively.

Output

Print a single integer, the number of solutions to the given conditions. If no solutions exist, print 0.

Examples
Input
9 5
Output
4
Input
3 3
Output
2
Input
5 2
Output
0
Note

In the first sample, we have the following solutions: (2,7), (3,6), (6,3), (7,2).

In the second sample, the only solutions are (1,2) and (2,1).


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 879 题。保留原作者与原赛事署名。