Problem:
 Score : 100 points    Problem Statement There is an N -car train.  You are given an integer i . Find the value of j such that the following statement is true: "the i -th car from the front of the train is the j -th car from the back."      Constraints  1 \leq N \leq 100  1 \leq i \leq N         Input Input is given from Standard Input in the following format:  N  i       Output Print the answer.        Sample Input 1 4 2      Sample Output 1 3  The second car from the front of a 4 -car train is the third car from the back.       Sample Input 2 1 1      Sample Output 2 1       Sample Input 3 15 11      Sample Output 3 5

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b=map(int, input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
def solve(string):
    n, i = map(int, string.split())
    return str(n - i + 1)


if __name__ == '__main__':
    print(solve(input()))

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=(int(i) for i in input().split())
print(N-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
a, b = map(int, input().split())
print(a + 1 - b)

Solution (Python):
n,i = map(int, input().split())
print(n - i + 1)

Solution (Python):
a, b = input().split(" ")
print(int(a) - int(b) + 1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
n, i = map(int,input().split())

print(n - i + 1)

Solution (Python):
from sys import stdin
a, b = [int(x) for x in stdin.readline().rstrip().split()]

print(a-b+1)

Solution (Python):
a,b = [int(i) for i in input().split()]

print(a - b + 1)

Solution (Python):
def main():
    N, i = map(int, input().split())
    print(N - i + 1)


if __name__ == "__main__":
    main()

Solution (Python):
print(eval(input().replace(" ","-"))+1)

Solution (Python):
n,i = (int(x) for x in input().split())

ans = n-i+1

print(ans)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools


sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    N, i = LI()
    print(N-i + 1)

main()

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in sys.stdin.readline().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


def main():
    N, i = li_input()
    print(N - i + 1)


main()

Solution (Python):
N, i = input().split()

N = int(N)
i = int(i)

print(N - i + 1)

Solution (Python):
A, B = map(int, input().split())
print(A + 1 - B)

Solution (Python):
N, i = map(int, input().split())
print(N - i +1)

Solution (Python):
n,k = map(int, input().split())
print(n-k+1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
def main() -> None:
    A, B = map(int, input().split())
    print(A - B + 1)


if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())
print(a - b + 1)

Solution (Python):
N,i = map(int, raw_input().split())
print N-i+1

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())

print(int(n-i+1))

Solution (Python):
a,b=map(int,input().split())
print(int(a-b+1))

Solution (Python):
N, i = [int(x) for x in input().split()]

print(N - i + 1)

Solution (Python):
int_n, int_i = map(int, input().split())
print(int_n - int_i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
import sys

def main():
  input = sys.stdin.readline
  n, i = map(int, input().split())
  print(n-i+1)


if __name__ == '__main__':
  main()

Solution (Python):

N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N, I = [int(x) for x in input().split()]
print(N - I + 1)

Solution (Python):
n,i = map(int, input().split())

print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n+1-i)

Solution (Python):
n,i=[int(i) for i in input().split()]
print(n-i+1)

Solution (Python):
n, i  = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i = list(map(int,input().split()))
print(n-i+1)

Solution (Python):
a, b = map(int,input().split())
print(a-(b-1))

Solution (Python):
m,n=map(int,input().split())
print(m-n+1)

Solution (Python):
m, n = map(int, input().split())
print(m-n+1)

Solution (Python):
n,i = map(int,input().split())
x = []
for t in range(n+1):
    x.append(t)
print(x[n-i+1])

Solution (Python):
n, i = map(int, input().split())
ans = n-i+1
print(ans)

Solution (Python):
print(eval(input().replace(" ","-"))+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
n,i = map(int,input().split())
print(n+1-i)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, m = map(int, input().split())
print(n-m+1)

Solution (Python):
N,i = map(int,input().split())
print(N+1-i)

Solution (Python):
N, i = map(int,input().split())
print(N - (i - 1))

Solution (Python):



from sys import stdin
import numpy as np

N, i = map(int, raw_input().split() )
print N-i + 1

Solution (Python):
N, i = map(int, input().split())

if i == N:
  print("1")
else:
  print((N - i) + 1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
A,B=map(int,input().split())
print(A-B+1)

Solution (Python):
n, i = [int(_) for _ in input().split()]
print(n - i + 1)

Solution (Python):
N,i = input().split(" ")
N,i = int(N),int(i)
print(N - i + 1)

Solution (Python):
a = input().split()
for i in range(len(a)):
	a[i] = int(a[i])
print(a[0] - a[1] + 1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):

N, i = map(int, input().split(' '));

print( N - i + 1 )

Solution (Python):
N, i = [int(n) for n in input().split()]

print(N + 1 - i)

Solution (Python):
def main():
    N, i = map(int, input().split())
    print(N - i + 1)


main()

Solution (Python):
"""AtCoder"""

import sys
input = sys.stdin.readline

N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):


def main():
    na = list(map(int, input().split()))
    N, i = na[0], na[1]

    print(N + 1 - i)


if __name__ == '__main__':
    main()

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
N, i = map(int,input().split())

print(N-i+1)

Solution (Python):
N,i =map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
def main():
    n, i = map(int, input().split())
    print((n + 1) - i)


if __name__ == '__main__':
    main()

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(int(N)+1-int(i))

Solution (Python):
N,i=map(int,input().split())
print(int(N)+1-int(i))

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())
print (N-i+1)

Solution (Python):

N, i = map(int, input().split(' '))
print(N - i+ 1)

Solution (Python):
N, i = map(int, str(input()).split())
print(N - i + 1)

Solution (Python):
n,i = map(int,input().split())
print(n+1-i)

Solution (Python):

N,i=list(map(int,input().split()))

print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
N, i = map(int,input().split())
print(N - (i - 1))

Solution (Python):
N , i = map(int,input().split())
print(N-i+1)

Solution (Python):
N,i = map(int, input().split())
print(N-i+1)

Solution (Python):
n,k=map(int,input().split())
print(n+1-k)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int,input().split())
print((N-i)+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N, i = [int(x) for x in input().split()]

print(N - i + 1)

Solution (Python):
N,i = map(int,input().split())
ans = N - i + 1
print(ans)

Solution (Python):
N, i = list(map(int, input().split()))
print(N-i+1)

Solution (Python):
a1,a2 = (int(i) for i in input().split()) 
ans = a1 - a2 + 1
print(ans)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N - i + 1)

Solution (Python):
def main():
    n, i = map(int, input().split())
    print(n - i + 1)


if __name__ == '__main__':
    main()

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
n,i = tuple(map(int,input().split()))

print(n-i+1)

Solution (Python):
a = list(map(int, input().split()))
print(a[0]-a[1]+1)

Solution (Python):
N,i = map(int,input().split())
print(N - i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N - i + 1)

Solution (Python):
a,b = map(int,input().split(" "))
print(a - b + 1)

Solution (Python):
N, i = map(int,input().split())

print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
n,i = map(int,input().split())

print(n+1-i)

Solution (Python):
N, i = list(map(int, input().split()))
print(N+1-i)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):


N,i=map(int,input().split())

print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N,i = map(int, input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n -i + 1)

Solution (Python):



def main():
    """Function."""
    n, i = map(int, input().split())
    print(n - i + 1)


if __name__ == "__main__":
    main()

Solution (Python):

N,i = map(int, input().split())
print("{}".format(N - i +1))

Solution (Python):
N,i = map(int,input().split())
print(N+1-i)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
if i!=n//2+1:
    print((n+1-i))
elif i==n//2+1:
    print(i)

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split(" "))
print(N+1-i)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = list(map(int, input().split()))
print(N - i + 1)

Solution (Python):
N, i = list(map(int, input().split()))
print(N + 1 - i)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):

N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
def main():
    N, i = map(int, input().strip().split())
    print(N - i + 1)
 
if __name__ == "__main__":
    main()

Solution (Python):
x=input()
x=x.split()
N=int(x[0])
I=int(x[1])
ans=N-I+1
print(ans)

Solution (Python):
n,i = map(int,input().split())
print((n+1) - i)

Solution (Python):


n,i=map(int,input().split())
z=n-i
z+=1
print(z)

Solution (Python):
def main():
    N, i = map(int, input().strip().split())
    print(N - i + 1)
 
if __name__ == "__main__":
    main()

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
print(eval(input().replace(' ','+1-')))

Solution (Python):
N, i = map(int, input().split())
print(N - i  + 1)

Solution (Python):
n,i=input().split()
print(int(n)-int(i)+1)

Solution (Python):
l = [int(i) for i in input().split()]
print(l[0] - l[1] + 1)

Solution (Python):
n, i = [int(i) for i in input().split()]
print(n-i+1)

Solution (Python):
N, i = map( int, input().split())

print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - (i-1))

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n, i = map(int,input().split())
print(n-i+1)

Solution (Python):
N,I=map(int,input().split())
x = N -I
x+=1
print(x)

Solution (Python):
n,i = map ( int , input () . split () )
j = n - i + 1
print( j )

Solution (Python):
n,i = map ( int , input () . split () )
j = n - i + 1
print ( j )

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
def main():
    N, i = map(int, input().strip().split())
    print(N - i + 1)

if __name__ == "__main__":
    main()

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N, i = [int(item) for item in input().split()]
print(N+1-i)

Solution (Python):
N,i = map(int,input().split(" "))
print(N-i+1)

Solution (Python):
a=input().strip().split(" ")
b=[int(i) for i in a]

print(b[0]-b[1]+1)

Solution (Python):
a,s=map(int,input().split())
print(int(a-s+1))

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):

def solve():
    N, i = map(int, input().split())
    print(N - i + 1)


if __name__ == '__main__':
    solve()

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
line = list(map(int,input().split()))
N = line[0]
i = line[1]

answer = N - i + 1
print(answer)

Solution (Python):
N,i = list(map(int,input().split()))
print(N - i + 1)

Solution (Python):
n,i=[int(a) for a in input().split()]
print(n-i+1)

Solution (Python):
n,i = map(int, input().split())
print(n+1-i)

Solution (Python):
val1,val2=input().split(" ")
val3=int(val1)-int(val2)+1
print(val3)

Solution (Python):
def calc (N,i):
    return N-i+1
N, i=map(int, input().split())
print(calc(N,i))

Solution (Python):
n,i = map(int, input().split())
print(n-i+1)

Solution (Python):
N,i=[int(x)for x in input().split()]
x=N-i+1
print(x)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
a,b=map(int,input().split())
if a == 1:
    print(1)
else:
    print(a-b+1)

Solution (Python):
ni = list(map(int, input().split()))
n = ni[0]
i = ni[1]
print(n - i + 1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
n,i = map(int,input().split())

print(n-i+1)

Solution (Python):
n,i=map(int,raw_input().split())
print n-i+1

Solution (Python):
n,i = map(int, input().split())
a = n-i+1
print(a)

Solution (Python):
a = list(map(int,input().split()))
print(a[0] - a[1] + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
import sys


def main():
    n, i = map(int, input().split())
    print(n + 1 - i)


main()

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
A = list(map(int, input().split()))
b = A[0]-A[1]+1
print(b)

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N, i = map(int, input().split())
    print(N - i + 1)


if __name__ == '__main__':
    main()

Solution (Python):
N, i = map(int, raw_input().split())
print N + 1 -i

Solution (Python):
n,i=map(int,input().split())

train=[]
js=0

for x in range(1,n+1):
    train.append(x)
    
train=train[::-1]

for x in train:
    js +=1
    if x==i:
        print(js)
        break

Solution (Python):
nums = list(map(int, input().split()))
print(nums[0]-nums[1]+1)

Solution (Python):
def train(n, i):
    return n - i + 1

n, i = map(int, input().split())
print(train(n, i))

Solution (Python):
def a():
    s=list(map(int,input().split()))
    print(s[0]-s[1]+1)
a()

Solution (Python):
a = list(map(int,input().split()))
print(a[0] - a[1] + 1)

Solution (Python):
n,i = map(int, input().split())
print(n-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a- b + 1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = [int(i) for i in input().split()]

if N == 1:
    print(N)
else:
    print(N-i+1)

Solution (Python):
[n,i]=[int(i) for i in input().split()]
print(n+1-i)

Solution (Python):
a,b=map(int,input().split());print(a-b+1)

Solution (Python):
N, i = (int(i) for i in input().split(" "))
print(N - i + 1)

Solution (Python):
n, i=map(int, input().split())
print(n-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
value = input()
N,i = value.split()
N = int(N)
i = int(i)

print (N - i + 1)

Solution (Python):
n , i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = [int(i) for i in input().split()]
T = [i for i in range(N)]
L = N - T[i-1] if N != 1 else 1
print(L)

Solution (Python):
N, i =  map(int, input().split())
print(N + 1 - i)

Solution (Python):
n,i=map(int,input().split())
trainn=(n+1)-i
print(trainn)

Solution (Python):
N,i=map(int,input().split())
car=(N+1)-i
print(car)

Solution (Python):
n,i=map(int,input().split())
car=(n-i)+1
print(car)

Solution (Python):
k,n  = map(int,input().split())

o = k  -n+1 
print(o)

Solution (Python):
kkkk,nnnn=map(int,input().split())
o=kkkk-nnnn+1
print(o)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
car=(n+1)-i
print(car)

Solution (Python):
N,i=map(int, input().split())
j=0
if i>=1 and N>=1 and i<=N and N<=100 :
    j=N-i+1
print (j)

Solution (Python):
n , i = map(int, input().split())
print(n+1-i+1-1)

Solution (Python):
N, i = [int(_) for _ in input().split()]
print(N + 1 - i)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
if 1<=n<=100:
    if 1<=i<=n:
         j=n-i+1
print(j)

Solution (Python):
n,i=map(int,input().split())
x=n-i
x+=1
print(n-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
n,i = map(int,input().split())

print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
if (1<=N<=100)and (1<=i<=N):
    j=N-i+1
print(j)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
if 1<=n<=100:
    if 1<=i<=n:
         j=n-i+1
print(j)

Solution (Python):
n,i=map(int,input().split())
if (1<=n<=100)and (1<=i<=n):
    j=n-i+1
print(j)

Solution (Python):
n, i = map(int, input().split())
if n>100:
  n=10 
j=n+1-i
if j<0:
    j=i-n+1
print(j)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
totalnumber,numberfromfront=map(int, input().split())
numberfromback=totalnumber-numberfromfront+1
print(numberfromback)

Solution (Python):
a,b=map(int,input().split())

c=a-b+1
if a==0:
    c=0
print (c)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
l = list(map(int,input().split()))
print(l[0]-l[1]+1)

Solution (Python):
N,i = map(int,input().split())
x = (N-i)+1
print(x)

Solution (Python):
N,i = map(int,input().split())
if N>=1 and N<=100 and i>=1 and i<=N :
    x = (N-i)+1
print(x)

Solution (Python):
n,I=input().split()
N=int(n)
i=int(I)
print(N+1-i)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
ahmed,khalil=map(int,input().split())
print(ahmed-khalil+1)

Solution (Python):

a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n ,  i    = map(int,input().split())
j=n-i+1
print(j)

Solution (Python):
N, i = map(int, input().split())
j  = N - i +1
print(j)

Solution (Python):
n,i=map(int,input().split())
if 1<=n<=100:
    if 1<=i<=n:
        j= n-i+1
print(j)

Solution (Python):
N,i=list(map(int, input().split()))
s=(1+N-i)
print(s)

Solution (Python):
a , b = map (int, input().split())

a = int(a)
b = int (b)
x= (a - b) + 1

print (x)

Solution (Python):
N,i=map(int,input().split())
j=(N-i)+1
print(j)

Solution (Python):

value=input()
x,z = value.split()
x=int(x)
z = int(z)
print ( x - z +1)

Solution (Python):
def train(N,j):
    y = N - j +1
    return y

value=input()
x,z = value.split()
x=int(x)
z = int(z)
print ( train (x,z))

Solution (Python):
a , b = map(int, input().split())

a = int(a)
b = int(b)

x = (a - b) + 1

print(x)

Solution (Python):
n,i=map(int,input().split())
if n>0 and i>0:
    print(n-i+1)

Solution (Python):
n , i =input().split()
n = int(n)
i = int(i)
if n >= 1 and n <= 100 and i >= 1 and i <= n :
    j = n - i + 1
    print (j)

Solution (Python):

n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=[int(x)for x in input().split()]
x=N-i+1
print(x)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):




N,i=map(int,input().split())
print((N+1)-i)

Solution (Python):
N,i= map(int,input().split())
if N>=1 and N<=100 and i>=1 and i<=N:
    j=N-(i-1)
    
    
print(j)

Solution (Python):
N,i=map(int,input().split())
if (1<=N<=100)and (1<=i<=N):
    j=N-i+1
print(j)

Solution (Python):

n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
print((N+1)-i)

Solution (Python):
N, i = map(int ,input().split())
j = N - i + 1
print(j)

Solution (Python):
n,i=input().split()
j=(int(n)-int(i))+1
print (j)

Solution (Python):
n,i=map(int,input().split())
if n>0 and i>0:
    print(n-i+1)

Solution (Python):
n , i =input().split()
n = int(n)
i = int(i)
if n >= 1 and n <= 100 and i >= 1 and i <= n :
    j = n - i + 1
    print (j)

Solution (Python):
n,i = map(int, input().split())

if n == i:
    print (1)
else :
    print ((n-i)+1)

Solution (Python):


n,i  = map(int, input().split())
print(n-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,i = (int(x) for x in input().split())
print(n - i + 1 )

Solution (Python):
n,i=map(int,input().split())
j=0
for v in range(n):
    j=j+1
    if (n-1)>= i:
        
        n=n-1

    else:    
        break
 
print (j)

Solution (Python):
N, i = map(int,input().split())

print((N - i + 1))

Solution (Python):
N, i = map(int,input().split())
print((N - i + 1))

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
k=list(map(int , input().split()))
N=k[0]
i=k[1]
print(N-i+1)

Solution (Python):
n, i= map(int,input().split())
if 1<=n<=100:
 if 1<=i<=n:
  j= n-i+1
print(j)

Solution (Python):

n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i=map(int,input().split( ))
count=0

while N>=i:
    count+=1
    N-=1


print(count)

Solution (Python):
N = list( map( int, input().split()) )
print (N[0]-N[1]+1)

Solution (Python):
t,i = map(int,input().split(" "))
j=t-i+1 
print(j)

Solution (Python):
n , i = map(int , input('').split())
print(n - i + 1)

Solution (Python):
N, i = [int(x) for x in input().split()]
print(N - i + 1)

Solution (Python):
n,i=map(int,input().split())
print (n-i+1)

Solution (Python):
n,i=map(int,input().split())
print (n-i+1)

Solution (Python):
N, i =map(int, input().split())
print(N-i+1)

Solution (Python):
d=[int(i) for i in input().split()]
print(d[0]-d[1]+1)

Solution (Python):
n,a=map(int , input().split())
print(n-a+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = list(map(int, input().split()))
print(N-i+1)

Solution (Python):
N, i = list(map(int, input().split()))
print(N-i+1)

Solution (Python):

N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = list(map(int, input().split()))
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N=list(map(int,input().split()));print(N[0]-N[1]+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N, i=map(int, input(). split())
print(N-i+1)

Solution (Python):
line = input().split()
N = int(line[0])
i = int(line[1])

A = N - i
if A != 0:
    print(A + 1)
else:
    print("1")

Solution (Python):
N, i = map(int,input().split())

print(N-i+1)

Solution (Python):
N,i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n, i = map(int,input().split())
print (n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n,i = map(int,input().split())
print(n-(i-1))

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
def solution(x, y):
    return x - y + 1

def main():
    x, y = [int(i) for i in raw_input().strip().split()]
    print solution(x, y)

if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int, input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
N,i = map(int, input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i +1)

Solution (Python):
a,b=map(int,input().split())
t=a-b+1
print(t)

Solution (Python):

N,i=map(int,input().split())

print(N-i+1)

Solution (Python):
a,b = input().split()
print(int(a)-int(b)+1)

Solution (Python):
a, b = map(int, input().split())
print((a - b) + 1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)