Problem:


Score : 300 points

Problem Statement

Snuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.

Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:

Operation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.

For example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.
If the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.
Besides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.

Find the minimum number of operation Snuke needs to perform in order to score at least x points in total.

Constraints

1 ≦ x ≦ 10^{15}

x is an integer.

Input

The input is given from Standard Input in the following format:

x

Output

Print the answer.

Sample Input 1

7

Sample Output 1

2

Sample Input 2

149696127901

Sample Output 2

27217477801



Sample input:
7


Sample output:
2

Submission status: Wrong Answer

Solution code:
x = int(input())

# x = 149696127901
def calculate(x):

    if x <= 6:
        return 1

    a = x // 11
    mod = x % 11

    if mod == 0:
        return 2*a

    if mod >= 6:
        return 2*a + 2

    return 2*a + 1



res = calculate(x)

print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

def calculate(x):
    a = x // 11
    mod = x % 11


    if a > 0:
        if mod == 0:
            return 2*a

        if mod == 6:
            return 2*a + 2

        if mod == 1:
            return 2*a + 2

        if mod >= 7:
            return 2*a + 2

        return 2*a + 1
    else:
        if x < 6:
            return 1
        else:
            return 2


res = calculate(x)

print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

def calculate(x):
    x = x - 1
    a = x // 11
    mod = x % 11


    if mod == 0:
        return 1 + 2*a
    if mod < 7:
        return 1 + 2*a +1
    else:
        return 1 + 2*a + 2


res = calculate(x)

print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

def calculate(x):
    x = x - 1
    a = x // 11
    mod = x % 11

    if mod == 0:
        res = 1 + 2 * a
        return res

    if mod < 7:
        res = 1 + 2*a +1
        return res

    res = 1 + 2*a + 2
    return res



res = calculate(x)

print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

print(-(-x*2//11))

Submission status: Wrong Answer

Solution code:
x = int(input())
#2回で3~11を作れる
count = 0
if x == 7:
  count=2
  x = 0
count += (x//11)*2
x = x%11
if x==0:
  count += 0
elif x>6:
  count+=2
elif x<=6:
  count += 1

Submission status: Wrong Answer

Solution code:
x = int(input())

#2回で3~11を作れる
count = 0
if x == 7:
  count=2
  x = 0

count += (x//11)*2
x = x%11
if x==0:
  count += 0
elif x>6:
  count+=2
elif x<6:
  count += 1


print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0

if 6 < x <= 11:
	print(2)
elif 5 >= x:
	print(1)
else:
	initcount = x // 11
	if initcount:
		count += initcount*2
		x -= initcount * 11
		mod = x % 11
		if 6 < mod <= 11:
			count += 2
		elif 0 < mod <= 5:
			count += 1
		else:
			pass
		print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0

if 6 < x <= 11:
	print(2)
elif 5 >= x:
	print(1)
else:
	initcount = x // 11
	if initcount:
		count += initcount*2
		x -= initcount * 11
		mod = x % 11
		if 6 < mod <= 11:
			count += 2
		elif 0 < mod <= 5:
			count += 1
		else:
			count += 0
		print(count)

Submission status: Wrong Answer

Solution code:
X = int(input())
print((X // 11) * 2 + (X % 11) // 6 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0

if 6 < x <= 11:
	print(2)
elif 5 >= x:
	print(1)
else:
	initcount = x // 11
	if initcount:
		count += initcount*2
		x -= initcount * 11
		mod = x % 11
		if 6 < mod <= 11:
			count += 2
		else:
			count += 1
		print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0

if 6 < x <= 11:
	print(2)
elif 5 >= x:
	print(1)
else:
	initcount = x // 11
	if initcount:
		count += initcount*2
		x -= x // 11
		mod = x % 11
		cx = x + mod
		if 6 < cx <= 11:
			count += 2
		else:
			count += 1
		print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
allsm = 6
count = 1

initcount = x // 11
if initcount:
	count += initcount*2
	x -= initcount * 11
	allsm += initcount * 11

while allsm <= x:
	allsm += 5
	count += 1
	if allsm >= x:
		break
	allsm += 6
	count += 1

print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

#2回で3~11を作れる
count = 0
if x == 7:
  count=2
  x = 0

count += (x//11)*2
x = x%11
if x==0:
  count = count
elif x>7:
  count+=2
elif x ==7:
  count += 3
elif x<7:
  count += 1


print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

#2回で3~11を作れる
count = 0

count += (x//11)*2
x = x%11
if x<7:
  count += 1
elif x>7:
  count+=2
else:
  count += 3


print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

#2回で3~11を作れる
count = 0

count += (x//11)*2
x = x%11
if x > 6:
  count += 2
else:
  count += 1

print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans =(x//11)*2
if x%11 > 6:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(2*(x//11)+(x%11)//6+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
x11 = x/11
num = [1,2,3,4,5,6]
num2= [7,8,9,10]

if x in num:
  print(1)
  exit()
elif x in num2:
  print(2)
  exit()

elif int(x11) == x11:
  print(int(x11)*2)
  exit()
elif x+5 >int(x11)*2 + 6 >= x:
  print(1+int(x11)*2)
  exit()
else:
  print(2+int(x11)*2)
  exit()

Submission status: Wrong Answer

Solution code:
x = int(input())
x11 = x/11
num = [1,2,3,4,5,6]
num2= [7,8,9,10]

if x in num:
  print(1)
elif x in num2:
  print(2)

elif int(x11) == x11:
  print(int(x11)*2)
elif x+5 >int(x11)*2 + 6 >= x:
  print(1+int(x11)*2)
else:
  print(2+int(x11)*2)

Submission status: Wrong Answer

Solution code:
x = int(input())
x11 = x/11
num = [1,2,3,4,5,6]
num2= [7,8,9,10]

if x in num:
  print(1)
elif x in num2:
  print(2)

elif int(x11) == x11:
  print(int(x11)*2)
else:
  print(1+int(x11)*2)

Submission status: Wrong Answer

Solution code:
x = int(input())

def calc(n):
  if n < 7:
    return 1
  elif n < 12:
    return 2
  else:
    return (n // 11)*2 + calc(n % 11)

print(calc(x))

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    print(1)
else:
    ans = (x//11)*2
    if (x//11)*11 +6 >= x:
        print(ans+1)
    else:
        print(ans+2)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
x=I()
base=2*(x//11)
if x%11==0:
    print(base)
elif x%11<=5:
    print(base+1)
else:
    print(base+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = (x // 11) * 2
if x % 11 > 6:
    ans += 2
else:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
m = 11
if x < 7:
  ans = 1
elif x < 11:
  ans = 2
elif x%m == 0:
  ans = x*2//m
elif 0 < x%m <= 6:
  ans = x*2//m+1
elif 7 <= x%m:
  ans = x*2//m+1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import *
x = int(input())
m = 11
if x < 6:
  ans = 1
elif x < 11:
  ans = 2
elif x%m == 0:
  ans = x*2//m
elif 0 < x%m <= 5:
  ans = x*2//m+1
elif 6 <= x%m:
  ans = x*2//m+1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import *
x = int(input())
m = 11
if x < 6:
  ans = 1
elif x < 11:
  ans = 2
elif x%m == 0:
  ans = x*2//m
elif 0 < x%m <= 5:
  ans = x*2//m+1
elif 6 <= x%m:
  ans = x*2//m+2
print(ans)

Submission status: Wrong Answer

Solution code:
from math import *
x = int(input())
m = 11
if x%m <= 5:
  ans = x*2//m+1
else:
  ans = ceil(x*2/m)
print(ans)

Submission status: Wrong Answer

Solution code:
from math import *
x = int(input())
m = 11
ans = ceil(x*2/m)
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
print(math.ceil(x/11*2))

Submission status: Wrong Answer

Solution code:
x = int(input())

print(2*(x-1)//11 + ((x-1)%11)//6 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

print((x-1)//11 + ((x-1)%11)//6 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

print((x-1)//11 + ((x-1)%11)//6)

Submission status: Wrong Answer

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
   n = int(input())
   print((2*(n//11)) + (n%11>0 and n%11<=6) + (n%11>6))



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
   n = int(input())
   print((2*(n//11)) + (n%11>0 and n%11<=6) + (n>6))



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x % 11)
if x % 11 == 0:
    print(x // 11 * 2)
elif x % 11 <= 6:
    print(x // 11 * 2 + 1)
else:
    print(x // 11 * 2 + 2)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x%11<=6:
    print(x//11*2+1)
else:
    print(x//11*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x//11 * 2
ans += (x % 11)//6 * 1 + 1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import ceil
x = int(input())
print(ceil(2*x/11))

Submission status: Wrong Answer

Solution code:
n=int(input())
p=n//11
print(p*2+2 if 11*p+6<n else p*2+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
def Main(x):
    d, m = divmod(x, 11)
    if m == 0:
        return d*2
    else:
        return d*2+(m//6+1)
    
print(Main(x))

Submission status: Wrong Answer

Solution code:
x = int(input())
def Main(x):
    d, m = divmod(x, 11)
    return d*2+(m//6+1)
    
print(Main(x))

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0

if x % 11 == 0:
    ans = (x // 11) * 2
elif x % 11 <= 5:
    ans = ((x // 11) * 2) + 1
else:
    ans = ((x // 11) * 2) + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0

if x % 11 == 0:
    ans = (x // 1) * 2
elif x % 11 <= 5:
    ans = ((x // 11) * 2) + 1
else:
    ans = ((x // 11) * 2) + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0

if x % 11 == 0:
    ans = (x // 1) * 2
elif x % 11 <= 6:
    ans = ((x // 11) * 2) + 1
else:
    ans = ((x // 11) * 2) + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

divided_11 = x // 11
check_num = divided_11 * 11
ans = divided_11 * 2

while True:
    check_num += 6
    ans += 1
    if check_num >= x:
        print(ans)
        break
    check_num += 5
    ans += 1
    if check_num >= x:
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
x = int(input())
q = x%11
if q == 0:
    print(2*(x//11))
if q <= 6:
    print(2*(x//11)+1)
else:
    print(2*(x//11)+2)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
x = int(input())
print((x // 11) * 2 + (2 if x % 11 > 6 else 1))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
ans += 2*(n // 11)
n %= 11
if n >= 7:
    print(ans+2)
elif n >= 1:
    print(ans+1)

Submission status: Wrong Answer

Solution code:
x=int(input())

d=-(-x//11)
r=x%11
if r<=6:
  print(2*d-1)
else:
  print(2*d)

Submission status: Wrong Answer

Solution code:
x=int(input())

d=x//11
r=x%11
if r<=6:
  print(2*d+1)
else:
  print(2*d+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x // 11 * 2
x -= ans * 11
if x > 6:
    ans += 2
elif x > 0:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

print(x//11*2 + 1 if x%11<=6 else x//11*2 + 2)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:27:39 2020

@author: shinba
"""

x = int(input())

if x%11 <=6:
    print(2*(x//11)+1)
else:
    print(2*(x//11)+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

div = x // 11
mod = x % 11

if (mod <= 6):
    ans = div * 2 + 1
else:
    ans = div * 2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x // 11
b = x % 11


if(b > 5 and b != 0):
    print(a*2 + 2)
elif(b <= 5 and b != 0):
    print(a*2 + 1)
elif(b == 0):
    print(a*2)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x // 11
b = x % 11


if(b > 5):
    print(a*2 + 2)
else:
    print(a*2 + 1)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
print(math.ceil(x/11 * 2))

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

ans = x//11 * 2
x %= 11

if x == 0:
	print(ans)
else:
	ans += x//6 + 1
	print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

ans = x//11 * 2
x %= 11

if x == 0:
	print(ans)
else:
	ans += ans//6 + 1
	print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

ans = x//11 * 2
x %= 11

ans += x//6 + 1

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 0

if x <= 11:
    cnt = 2
else:
    a = int(x/11)
    cnt = a*2
    x -= 11*a
    if x < 7 and x > 0:
        cnt += 1
    else:
        cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 0

if x <= 11:
    cnt = 2
else:
    a = int(x/11)
    cnt = a*2
    x -= 11*a
    if x < 7:
        cnt += 1
    else:
        cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
num = [i for i in range(1,7)]
cnt = 0

if x <= 11:
    cnt = 2
else:
    a = int(x/11)
    cnt = a*2
    x -= 11*a
    if x < 7:
        cnt += 1
    elif x == 7:
        cnt += 3
    else:
        cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
a = int(input())
if a<=6:
    print("1")
    exit()
if a<=11:
    print("2")
    exit()
if a%11==0:
    print(int(a/11)*2)
    exit()
if a%11<=6:
    print(int(a/11)*2+1)

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
x = int(input())
cnt = 0
if x<=6:
    print(1)
elif x<=11:
    print(2)
else:
    if x%11 == 0:
        print((x//11)*2)
    elif x%11 > 6:
        print(((x+1)//11)*2)
    else:
        print((x//11)*2 + 1)

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
x = int(input())
cnt = 0
if x<=6:
    print(1)
elif x<=11:
    print(2)
else:
    if x%11 == 0:
        print((x//11)*2)
    else:
        print((x//11)*2 + 1)

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
x = int(input())
cnt = 0
if x<=6:
    print(1)
elif x<=11:
    print(2)
else:
    if x%11 == 0:
        print((x//11)*2)
    else:
        print((x/11)*2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x <= 6:
	print(1)
else:
	A = x//11
	if x%11 == 0:
		print(2*A)
	else:
		B = x - 11*A
		C = B//6 +1
		print(2*A+C)

Submission status: Wrong Answer

Solution code:
x = int(input())
Cnt = 0
if x <= 6:
	print(1)
else:
	A = x//11
	B = x - 11*A
	C = B//6 +1
	print(2*A+C)

Submission status: Wrong Answer

Solution code:
x = int(input())
Cnt = 0
if x <= 6:
	print(1)
elif x<=11:print(2)
else:print(2*x//11+(x%11)//6+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 6:
    print('1')
else:
    if x%11 <=6:
        print(x//11*2+1)
    else:
        print(x//11*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
print((x // 11) * 2 + (2 if 7 <= x <= 10 else 1))

Submission status: Wrong Answer

Solution code:
x=int(input())
if x%11<7:
  print((x//11)*2+1)
else:
  print((x//11)*2+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x<=6:
  print(1)
else:
  ans=(x//11)*2
  if (x//11)%2==0:
    if x%11<=6:
      ans+=1
    else:
      ans+=2
  else:
    if x%11<=5:
      ans+=1
    else:
      ans+=2
  print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x>=11:
  if x%11==0:
    print((x//11)*2)
  else:
    print((x//11)*2+1)
elif 6<x<11:
  print(2)
else:
  print(1)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x>11:
  print((x//11)*2+1)
elif 6<x<=11:
  print(2)
else:
  print(1)

Submission status: Wrong Answer

Solution code:
x = int(input())
y = x % 11
z = x // 11
if 0 <  y  <= 5:
    print(2*z + 1)
elif y == 0:
    print(2*z)
elif 7 <= y <= 11:
    print(2*z +2 )

Submission status: Wrong Answer

Solution code:
def resolve():
    X = int(input())
    res = (X // 11) * 2
    rem = X % 11
    if 0 < rem and rem <= 6:
        res += 1
    else:
        res += 2
    print(res)

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    X = int(input())
    res = (X // 11) * 2
    rem = X % 11
    if rem <= 6:
        res += 1
    else:
        res += 2
    print(res)

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
import math 
x = int(input())
Su = math.floor(x/11)
M = x%11
if x < 11:
    if x <=6:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(Su*2)
    else:
        if M <= 5:
            print(Su*2+1)
        else:
            print(Su*2+2)

Submission status: Wrong Answer

Solution code:
import math 
x = int(input())
Su = math.floor(x/11)
M = x%11
if x < 11:
    if x <=5:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(Su*2)
    else:
        if M <= 5:
            print(Su*2+1)
        else:
            print(Su*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
Su = int(2*x/11)
M = x%11
if x < 11:
    if x <=5:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(Su)
    else:
        if M <= 5:
            print(Su+1)
        else:
            print(Su+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
Su = int(x/11)
M = x%11
if x < 11:
    if x <=5:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(Su*2)
    else:
        if M <= 5:
            print(Su*2+1)
        else:
            print(Su*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
Su = x/11
M = x%11
if x < 11:
    if x <=5:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(int(Su*2))
    else:
        if M <= 5:
            print(int(Su*2+1))
        else:
            print(int(Su*2+2))

Submission status: Wrong Answer

Solution code:
x = int(input())

Su = int(x/(11))
M = int(x%(11))
if x < 11:
    if x <=5:
        print(1)
    else:
        print(2)
else:
    if M ==0:
        print(Su*2)
    else:
        if M <= 5:
            print(Su*2+1)
        else:
            print(Su*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

Su = int(x/(6+5))
M = int(x%(6+5))
if M ==0:
    print(Su*2)
else:
    if M <= 5:
        print(Su*2+1)
    else:
        print(Su*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
double, rest = divmod(x, 11)
if rest <= 6:
    add = 1
elif rest > 6:
    add = 2
else:
    add = 0
ans = double * 2 + add
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
double, rest = divmod(x, 11)
add = 0
if rest <= 6:
    add = 1
elif rest > 6:
    add = 2
ans = double * 2 + add
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
double, rest = divmod(x, 11)
if rest <= 6:
    add = 1
elif rest > 6:
    add = 2
ans = double * 2 + add
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
double, rest = divmod(x, 11)
if rest <= 6:
    add = 1
else:
    add = 2
ans = double * 2 + add
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
c = 2 * (x // 11)
if x % 11 == 0:
    pass
elif x - 11 * (x // 11) > 5:
    c += 2
else:
    c += 1
print(c)

Submission status: Wrong Answer

Solution code:
x = int(input())
c = 2 * (x // 11)
if x - 11 * (x // 11) > 5:
    c += 2
else:
    c += 1
print(c)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x%11==0:
    print(x//11*2)
elif x%11<=5:
    print(x//11*2+1)
else:
    print(x//11*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x//11*2+1 if x%11<=5 else x//11*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x // 11 * 2

if x % 11 != 0:
    if x % 11 >= 5:
       ans += 2
    else:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x // 11 * 2
if x % 11 >= 5:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())
ans=a//11*2
a%=11
if 6>=a>=1:ans+=1
elif a!=1:ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())
ans=a//11*2
a%=11
if a>=6>=1:ans+=1
elif a!=1:ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
if x <= 6:
    ans = 1
elif 6 < x < 11:
    ans = 2
else:
    if x % 11 > 6:
        ans = ((x // 11) * 2) + 2
    elif x % 11 <= 6:
        ans = ((x // 11) * 2) + 1
    else:
        ans = (x // 11) * 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
if x <= 6:
    ans = 1
elif 6 < x < 11:
    ans = 2
else:
    if x % 11 > 6:
        ans = ((x // 11) * 2) + 2
    else:
        ans = ((x // 11) * 2) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
k = x // 11
l = x % 11
ans = 2 * k + l // 6 + 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n%11 == 0:
    print((n//11)*2)
elif n%11 < 6:
    print((n//11)*2+1)
else:
    print((n//11)*2+2)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n < 7:
    print(0)
elif n%11 > 6:
    print((n//11+1)*2)
else:
    print((n//11+1)*2-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n%11 > 6:
    print((n//11+1)*2)
else:
    print((n//11+1)*2-1)

Submission status: Wrong Answer

Solution code:
x=int(input())

if x<=6:
    print("1")
    exit()
elif x<=11:
    print("2")
    exit()
else:
    ans=((x//11)*2)
    if x%11<=6:
        print(ans+1)
    elif x%11==0:
        print(ans)
    else:
        print(ans+2)

Submission status: Wrong Answer

Solution code:
x=int(input())

if x<=6:
    print("1")
    exit()
elif x<=11:
    print("2")
    exit()
else:
    ans=((x//11)*2)
    if x%11<=6:
        print(ans+1)
    else:
        print(ans+2)

Submission status: Wrong Answer

Solution code:
for i in range(1,40):
  a = i//(5+6)
  if i-11*a==0:
    print(2*a)
  elif 1<=i-11*a<=6:
    print(2*a+1)
  else:
    print(2*a+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = x//(5+6)
if x-11*a==0:
  print(2*a)
elif 1<=x-11*a<=5:
  print(2*a+1)
else:
  print(2*a+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

q = x // 11; r = x % 11

print(2 * q + 1 if r <= 6 else 2 * q + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

d, m = divmod(x, 11)
d *= 2

if m >= 7:
    d += 2
else:
    d += 1
print(d)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = x//11*2
if x%11 <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

a, b = divmod(X, 11)

if b <= 6:
    print(a * 2 + 1)
else:
    print(a * 2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x % 5.5 == 0:
    print(int(x // 5.5))
else:
    print(int(x//5.5 + 1))

Submission status: Wrong Answer

Solution code:
x = int(input())
print(int(x//5.5 + 1))

Submission status: Wrong Answer

Solution code:
x = int(input())

print(x//5.5+1)

Submission status: Wrong Answer

Solution code:
x=int(input())
print((x//11)*2 + (0 if x%11==0 else (1 if x*(x//11)+6>=x else 2)))

Submission status: Wrong Answer

Solution code:
x=int(input())
print((x//11)*2 + (0 if x%11==0 else (1 if x*(x//11)+6>x else 2)))

Submission status: Wrong Answer

Solution code:
x=int(input())
print((x//11)*2 + 0 if x%11==0 else (1 if x*(x//11)+6>x else 2))

Submission status: Wrong Answer

Solution code:
x=int(input())
if x<7:
    print(1)
if x==7:
    print(2)
if x>7:
    if x%11==0:
        print(x//11*2)
    if x%11==1:
        print(x//11*2+1)
    if x%11==2:
        print(x//11*2+1)
    if x%11==3:
        print(x//11*2+1)
    if x%11==4:
        print(x//11*2+1)
    if x%11==5:
        print(x//11*2+1)
    if x%11==6:
        print(x//11*2+1)
    if x%11==7:
        print(x//11*2+2)
    if x%11==8:
        print(x//11*2+2)
    if x%11==9:
        print(x//11*2+2)
    if x%11==10:
        print(x//11*2+3)

Submission status: Wrong Answer

Solution code:
n = int(input())
result, r = divmod(n, 11)
print(result*2 + 1 + (r>6))

Submission status: Wrong Answer

Solution code:
n = int(input())
result, r = divmod(n, 11)
print(result*2 + 1 + (r>5))

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = (x//11)*2 if x%11 == 0 else (x//11)*2 + 1 if x%11 <= 5 else (x//11)*2 + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = (x//11) * 2 + 1 if x%11 <=5 else (x//11) * 2 + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())

xi=x//11
if xi==0:
    print(2*xi)
else:
    print(2*xi+1)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
print((x//11)*2 + math.ceil((x%11)/5))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n/5.5) if n%5.5==0 else int(n/5.5+1))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n//5.5) if n%5.5==0 else int(n//5.5+1))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n//5.5+1))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n//5.5+1)

Submission status: Wrong Answer

Solution code:
x = int(input())
a, b = divmod(x, 11)
if b > 5:
    print(a * 2 + 2)
elif b == 0:
    print(a * 2)
else:
    print(a * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x%11<=6:
    print((x//11)*2+1)
else:
    print((x//11)*2+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=(x//11)*2
x%=11
if 0<x<=6: ans+=1
else: ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=(x//11)*2
x%=11
if x<=6: ans+=1
elif x>0: ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=(x//11)*2
x%=11
if x<=6: ans+=1
else: ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

print(math.ceil(x/11 * 2))

Submission status: Wrong Answer

Solution code:
n=int(input())

if n<=6:
    print(1)
elif n<=11:
    print(2)
else:
    count = (n//11)*2
    if n%11 == 2:
        print(count+2)
    elif n%11 <= 6:
        print(count+1)
    else:
        print(count+2)