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



Sample input:
4 2


Sample output:
3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#comment

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
N, i = map(int, input().split())
print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

a=(N-i+1)

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#coding:utf-8
n,i = map(int,input().split())
print (n-i+1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin

ns = lambda: stdin.readline() # s = ns()
ni = lambda: int(stdin.readline()) # N = ni()
na = lambda: list(map(int, stdin.readline().split())) # Array or , = na()

N, i = na()
print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,i= map(int,raw_input().split())

print N-i+1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(N,i) :#107-A
    a = N-i
    anser = a+1
    return anser

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
info = input()
info = info.split()
backward = int(info[0]) - int(info[1]) + 1
print(backward)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = N - i +1


print(x)

Submission status: Accepted

Solution code:
def solve(n, i):
    return n - i + 1

assert solve(4, 2) == 3
assert solve(1, 1) == 1
assert solve(15, 11) == 5
n, i = map(int, raw_input().split())
print solve(n, i)

Submission status: Accepted

Solution code:
val = input().split()

a, b = [ int(i) for i in val ]

print(a-b+1)

Submission status: Accepted

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

Submission status: Accepted

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

print(n - i + 1)

Submission status: Accepted

Solution code:
def solve(N, i):
    return N - i + 1

if __name__ == "__main__":
    l = input()
    N, i = int(l.split()[0]),int(l.split()[1])
    print(solve(N,i))

Submission status: Accepted

Solution code:
#Q1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().split())

if a >= 1 and a <= 100 and b >= 1 and b <= a:
  c = a-b+1
  print c

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
num, the_num = map(int, input().split())
print(num - the_num + 1)

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
N, i = map(int, input().split())

print(list(range(1, N+1))[::-1][i-1])

Submission status: Accepted

Solution code:
ni = input().split()
n = int(ni[0])
i = int(ni[1])
print(n-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
a,b = [int(x) for x in str.split()]
print(a - b + 1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

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

Submission status: Accepted

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

print(n-i+1)

Submission status: Accepted

Solution code:
l = input().split()
N = int(l[0])
i = int(l[1])
print(N + 1 - i)

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

N,i=inpl()
print(N-i+1)

Submission status: Accepted

Solution code:

l = [int(x) for x in input().split( )]

ans = l[0] - l[1] + 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

pos = N - i + 1

print(pos)

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split(" ")]
ans = A[0] - A[1] + 1

print(ans)

Submission status: Accepted

Solution code:
N_str,i_str=input().split()
N=int(N_str)
i=int(i_str)

print(N-i+1)

Submission status: Accepted

Solution code:
N,i = (int(j) for j in input().split())

print(N - i + 1)

Submission status: Accepted

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


num = N-i+1
print(num)

Submission status: Accepted

Solution code:
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

n = int(arr_data[0][0])
i = int(arr_data[0][1])

print(n-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A=int(N)-(int(i)-1)

print(A)

Submission status: Accepted

Solution code:
train = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
l = input().split()
print(int(l[0])-int(l[1])+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, I = [int(_) for _ in input().split()]

print(N - I + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N, i = map(int, input().split())
print(N - i + 1)

Submission status: Accepted

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

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
f, r = map(int, raw_input().split())
print(f - r + 1)

Submission status: Accepted

Solution code:
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():
    a,b = LI()

    return a - b + 1



print(main())

Submission status: Accepted

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

print(n - i + 1)

Submission status: Accepted

Solution code:
#abc107a

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = (int(x) for x in raw_input().split())
print a+1-b

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = raw_input()
lst = map(int, l.split())
#print(lst)

a = lst[0] - lst[1]
print(a+1)

Submission status: Accepted

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

print(int(N) - int(i) + 1)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def LI(): return [int(x) for x in sys.stdin.readline().split()]

if __name__ == "__main__":
    n, i = LI()
    print(n-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
y = input().split()
print(int(y[0])-int(y[1])+1)

Submission status: Accepted

Solution code:
a = input().split(" ")
print(int(a[0])-int(a[1])+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy

from math import *

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, i] = [int(input_raw[0]), int(input_raw[1])]
    print N - i + 1
if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(N-(i-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().split()
N = int(n[0])
i = int(n[1])

print(str(N-i+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())

print(x - (y-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a,b = list(map(int,raw_input().split()))
print a-b+1

Submission status: Accepted

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

R = (N - i) + 1

print(R)

Submission status: Accepted

Solution code:
import sys

N, i = map(int, sys.stdin.readline().strip().split(" "))
print(N+1-i)

Submission status: Accepted

Solution code:
n, i = list(map(int, input().split(' ')))

print(n - i + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, i = map(int, input().split())
train = []
for k in range(1, n+1):
    if k == i:
        train.append('1')
    else:
        train.append('0')

train.reverse()
print(train.index('1')+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! usr/bin/env python
# -*- coding: utf-8 -*-


def main():
    n, i = map(int, input().split())

    print(n-i+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

line = input().split()
n = int(line[0])
i = int(line[1])

print(n-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_line(*types):
	return [f(a) for a, f in zip(input().split(), types)]

s = read_line(int,int)
print(s[0] - s[1] + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
chars = input()

raw_input = chars.split(' ')

n = int(raw_input[0])
i = int(raw_input[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(N - i + 1)

Submission status: Accepted

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

print(n - i + 1)

Submission status: Accepted

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

u = n-i+1

print(u)

Submission status: Accepted

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

print(N+1-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(N-i+1)

Submission status: Accepted

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

def findJ(num):
    return n+1-num;

print(findJ(i))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N,K=(int(i) for i in input().split())

print(N-K+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def run(a, b):
    return a - b + 1


def read_line():
    a, b = input().split()
    a = int(a)
    b = int(b)
    return (a, b)


def main():
    a, b = read_line()
    print(run(a, b))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input = input()
a,b = [int(data) for data in input.split(' ')]
rane = list(range(1, a+1))
print(rane[-b])

Submission status: Accepted

Solution code:
a = input().split(" ")
n = int(a[0])
i = int(a[1])
b = n + 1 - i
print(b)

Submission status: Accepted

Solution code:
n_str,i_str = input().split()
n = int(n_str)
i = int(i_str)
res = n - i + 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(N-i+1)

Submission status: Accepted

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

a = n - i + 1
print(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

print(N+1-i)

Submission status: Accepted

Solution code:
inputs = raw_input().replace("\n", "")
N, i = map(int, inputs.split(" "))
print N + 1 - i

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
nk=input().split()
n=int(nk[0])
k=int(nk[1])
print(n-k+1)

Submission status: Accepted

Solution code:

traindata = input().split(" ")
traindata = [int(c) for c in traindata]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve():
    a, b = list(map(int, input().split()))
    return str(a-b+1)

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

Submission status: Accepted

Solution code:
N = input().split()

result = int(N[0]) - int(N[1]) + 1

print(result)

Submission status: Accepted

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

A = N - i + 1
print(A)

Submission status: Accepted

Solution code:
x,y=input().split(" ")
x=int(x)
y=int(y)
print(x+1-y)

Submission status: Accepted

Solution code:
lis = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# This file is a "Hello, world!" in Python language by CPython for wandbox.

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

# CPython references:
#   https://www.python.org/

Submission status: Accepted

Solution code:
# coding:utf-8

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

ans = N - i + 1

print(ans)

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
kazu, mae = map(int, input().split())
print( kazu - mae + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_s = str(input())
[n, i] = list(map(int, input_s.split(' ')))
print(n - i + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N, i = list(map(int, input().split(" ")))
    output = solve(N, i)
    print(output)
    return

#________________________________________
#  Solve
#________________________________________
def solve(N, i):
    """
    解答のコード
    """
    return N - i + 1
#________________________________________


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*-codimg:utf-8-*-
N, i = map(int, input().split(" "))

print (N-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    la = list(map(int, input().split()))
    print(la[0] - la[1] + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,i = list(map(int,input().split(" ")))
ran = list(range(1,N+1))[::-1]
print(ran[i-1])

Submission status: Accepted

Solution code:
def main1():
    buf = input("");
    num = buf.split();
    hai = []
    for i in range(2):
        hai.append(int(num[i]));
    re= hai[0] - hai[1]+1
    print(re);

if __name__ == '__main__':
    main1()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = raw_input().split()
N =int( a[0])
i = int (a[1])

ans = N - i +1

print(ans)

Submission status: Accepted

Solution code:
#encoding utf-8

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding: utf-8
N, i = map(int, input().split())
print(N + 1 - i)

Submission status: Accepted

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

A=N-i+1

print(A)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, i = map(int, input().split())

print(N - i + 1)

Submission status: Accepted

Solution code:
import sys
N , i = map(int,input().split())

j = N - i + 1
print(j)

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

Submission status: Accepted

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
a = a.split()
l = list(map(int, a))

ans = l[0] - l[1] + 1
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8


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

Submission status: Accepted

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

ans = N - i + 1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    N, i = [int(x) for x in stdin.readline().rstrip().split()]
    print(N - i + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(N - i + 1)

Submission status: Accepted

Solution code:
N, I = map(int, input().split())

print(N - I + 1)

Submission status: Accepted

Solution code:
a = input().split()
n = int(a[0])
i = int(a[1])

print(n+1-i)

Submission status: Accepted

Solution code:
a = input().split()
n = int(a[0])
i = int(a[1])
print(n - i + 1)

Submission status: Accepted

Solution code:
ip = input().split()
data = []
for i in ip:
    data.append(int(i))

ans = data[0]- data[1] + 1
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

n, i = [int(i) for i in input().split()]

print(n - i + 1)

Submission status: Accepted

Solution code:
import sys

ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: [int(x) for x in ns().split()]
nall = lambda: [int(x) for x in sys.stdin.readlines()]

def main():
    n, i = na()
    print(n+1-i)

main()

Submission status: Accepted

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

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
#coding: utf-8

n,i = map(int,raw_input().split())

print n-i+1

Submission status: Accepted

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

print(a-b+1)

Submission status: Accepted

Solution code:
l = input().split(" ")
print(int(l[0])-int(l[1])+1)

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

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

print(N+1-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

print(n + 1 - i)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(n-(i-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(10000000)

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

Submission status: Accepted

Solution code:
N, i = map(int, raw_input().split())

print (N - i + 1)

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8
#


def main(n, i):
    retval = n - i + 1
    print(retval)
    
if __name__ == '__main__':
    try:
        n, i = list(map(int,input().strip().split(" ")))
        main(n, i)
    except EOFError:
        pass

Submission status: Accepted

Solution code:
def main():
    N, i = map(int, input().split())

    ans = N - i + 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout

input = lambda: stdin.readline().rstrip()
write = stdout.write

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

main()

Submission status: Accepted

Solution code:
inputs = input().strip().split()

N = int(inputs[0])
i = int(inputs[1])

print(N-i+1)

Submission status: Accepted

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