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())

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+1)-i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.readline().split()))
    print(A-B+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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:
n ,i = map(int,input().split())
ans = n-i+1
print(ans)

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:
def main():
    n, i = map(int, input().split())

    print(n-i+1)

if __name__ == '__main__':
    main()

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:
a, b = map(int, input().split())
print((a - b) + 1)

Submission status: Accepted

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

#----------
N,i = list(map(int, input().rstrip().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(x) for x 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:
n,i = map(int,input().split())
print(n+1-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda x: [ni() for _ in range(x)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

n, i = na()

print(n - i + 1)

Submission status: Accepted

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

Submission status: Accepted

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

print(N + 1 - i)
print()

Submission status: Accepted

Solution code:
#107_A
N,i=map(int,input().split())
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,j= map(int,raw_input().split())
print N-j+1

Submission status: Accepted

Solution code:
N, i = map(int, raw_input().split())
j = N - 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+1-i)

Submission status: Accepted

Solution code:
def examA():
    N, i = LI()
    ans = N - i + 1
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

Submission status: Accepted

Solution code:
def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


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


if __name__ == "__main__":
    main()

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:
x,y = map(int, input().split())

print(x-y+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, 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 main():
    N, i = map(int, input().split(" "))
    print(N + 1 - i)


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, i = map(int,input().split())
print(N - i + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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 = list(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:
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:
N, i = [int(i) for i in input().split()]

output = N - i + 1

print(output)

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())
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:
N,i=map(int,input().split())

print(N+1-i)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,i = map(int,input().split())
print(n-i+1)

Submission status: Accepted

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

print(a - b + 1)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 23, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, i = map(int, readline().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,i=map(int,input().split())
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,m = map(int,input().split())
print(n-m+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

    print(N - i + 1)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = map(int,input().split())

print(n-i+1)

Submission status: Accepted

Solution code:
import sys

n, i = map(int, sys.stdin.readline().split())

def main():
    return n + 1 - i

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

print(n - i + 1)

Submission status: Accepted

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

print(a - b + 1)

Submission status: Accepted

Solution code:
N,i=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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:
import sys
input = sys.stdin.readline
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:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

n, i = list(map(int, sys.stdin.buffer.readline().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:
# coding: utf-8

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

ans = n - i + 1
print(ans)

Submission status: Accepted

Solution code:
N,i=tuple(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:
a,b=map(int,input().split())
print(a-b+1)

Submission status: Accepted

Solution code:
import sys

input = input().split()
total = int(input[0])
front = int(input[1])

if(total<1 or total>100):
  sys.stderr.write('Error occurred!')
elif(front<1 or front > total):
  sys.stderr.write('Error occurred!')
else:  
  locationFromBack = (total-front) + 1
  print(locationFromBack)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N, i = [int(x) for x in 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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,i=INTM()
    print(n-i+1)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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:
def main():
    n,i = map(int,input().split())

    print(n+1-i)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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())
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())

print(n + 1 - i)

Submission status: Accepted

Solution code:
import sys 

n, i = map(int, sys.stdin.readline().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() )
print( N - i + 1 )

Submission status: Accepted

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

print(A-B+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, i = [int(x) for x 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:
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:
n, m = map(int, input().split())
print(n-m+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())
print(n-i+1)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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(" "))
 
print(N - i + 1)

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
# ABC107a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

n=N-i+1

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, i = input().split()
N = int(N)
i = int(i)
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,b = map(int,input().split())
#n = int(input())

print(a-b+1)

Submission status: Accepted

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

#入力
#S = str(input())
N, i = map(int, input().split())
#R = int(input())

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 = 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:
import sys,itertools
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(N - i + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, i: int):
    print(N-i+1)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    i = int(next(tokens))  # type: int
    solve(N, i)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

ret=n-i+1

  
print(ret)

Submission status: Accepted

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

ans = N - i + 1
print(ans)

Submission status: Accepted

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

print(N + 1 - K)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N, i = MAP()

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
import collections

n,i = [int(x) for x in stdin.readline().rstrip().split()]

print(n-i+1)

Submission status: Accepted

Solution code:
#Train
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:
n, i = map(int, input().split())
answer = n - i + 1
print(answer)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-09 16:39:51(JST)
### modules
## from standard library
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## from external libraries
# import scipy.special   
# import scipy.misc      
# import numpy as np 

def main():
    n, i = (int(x) for x in sys.stdin.readline().split())
    j = n - i + 1
    print(j)


if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Accepted

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

print(n-i+1)

Submission status: Accepted

Solution code:
# ABC107 A - Train
# 2019/11/07

N, i = map(int, open(0).read().split())
# print(N,i)
print(N-i+1)

Submission status: Accepted

Solution code:
N, i = [int(x) for x in 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:
a, b = map(int, input().split())
print(a+1-b)

Submission status: Accepted

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

ans = (N-i)+1
print(ans)

Submission status: Accepted

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


print(inputs[0]-inputs[1]+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())
list1=[x+1 for x in range(0,1000)]
list2=[y for y in range(1,N+1)]
if N in list1 and i in list2:
     x=(N-i)+1 
     print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
N,i = map(int,input().split(' '))
print(N+1-i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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())
j = N - i + 1
print(j)

Submission status: Accepted

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

Submission status: Accepted

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

print(m + 1 - i)

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())
print (N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def train():
    n = input().split(" ")
    j = (int(n[0])-int(n[1]))+1
    print(j)
    
    


train()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(N - (i-1))

Submission status: Accepted

Solution code:
n,i = input().split()
n=int(n)
i=int(i)
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 = tuple(map(int, input().split()))
print(N - i + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
'''A - Train
https://atcoder.jp/contests/abc107/tasks/abc107_a

>>> main(4, 2)
3
>>> main(1, 1)
1
>>> main(15, 11)
5'''


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


if __name__ == '__main__':
    n, i = map(int, input().split(' '))
    main(n, i)

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(str(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:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, i = list(map(int, input().rstrip('\n').split()))
    print(n - i + 1)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
N, i=map(int, input().split())
print(N-i+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 = 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,b=map(int,input().split());print(a-(b-1))

Submission status: Accepted

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

Submission status: Accepted

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

print(a-b+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline

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())
ans=N-i+1
print(ans)

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 = map(int, input().split())
print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

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

print(a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

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

print(N-i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

lines = sys.stdin.readlines()

(N, i) = [int(i) for i in lines[0].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 = list(map(int, input().split()))

print(n+1-i)

Submission status: Accepted

Solution code:
print(eval(input().replace(' ', '-')) + 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:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
a,b=map(int,input().split())

print(a-b+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input().split())
a=int(s[0])
b=int(s[1])
count=a-b+1
print(count)

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:
# ABC107 A - Train 
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())
r = N+1-i
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, 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:
a, b = map(int, input().split(" "))
print(a - b + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n, i = na()
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:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

print(int(num[0])-int(num[1])+1)

Submission status: Accepted

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