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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Solution (Python):
from math import ceil

n = int(input())


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

Solution (Python):
def resolve():
    x=int(input())
    q,mod=divmod(x,11)
    if mod==0:
        print(q*2)
    elif 1<=mod<=6:
        print((q+1)*2-1)
    else:
        print((q+1)*2)





resolve()

Solution (Python):
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)


inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""


def main():
    x = int(input())
    cnt = (x//11)*2
    res = x % 11
    if res == 0:
        cnt = cnt
    elif res <= 6:
        cnt = cnt+1
    else:
        cnt = cnt+2
    
    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())

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

Solution (Python):
x = int(input())
d, m = divmod(x, 11)
ans = d * 2
if m > 6:
  ans += 2
elif m > 0:
  ans += 1
print(ans)

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

print(cnt)

Solution (Python):
a = int(input())

if a <= 6:
    print(1)
else:
    if 7 <= a <= 11:
        print(2)
    else:
        t = a // 11
        a -= t * 11
        if 1 <= a <= 6:
            s = 1
        elif 7 <= a:
            s = 2
        else:
            s = 0
        print(t*2 + s)

Solution (Python):
import sys
import math
input = sys.stdin.readline

n = int(input())
ans = math.ceil(n / 11 * 2)
if (n - 6) % 11 == 0:
    ans -= 1
print(ans)

Solution (Python):



N = int(input())
cnt = 0
a = N // 11
amari = N % 11
cnt += a*2

if amari == 0:
    cnt += 0
elif amari <= 6:
    cnt += 1
else:
    cnt += 2
print(cnt)

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

Solution (Python):
x = int(input())

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

Solution (Python):
x = int(input())
"""
最初に1と6以外を上面にし、次に6を向くように操作、以降5656
"""
if x <= 6:
    print(1)
else:
    total = 1
    x -= 6
    total += (x // 11)*2
    amari = x % 11
    if amari == 0:
        print(total)
    elif amari <= 5:
        print(total+1)
    else:
        print(total+2)

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

Solution (Python):
def solve():
    N = int(input())
    ans = N // 11 * 2
    if N % 11 >= 7:
        ans += 2
    elif N % 11 >= 1:
        ans += 1
    
    print(ans)
    
if __name__ == '__main__':
    solve()

Solution (Python):
x = int(input())


if x % 11 == 0:
  ans = x // 11 * 2
elif x % 11 <= 6:
  ans = x // 11 * 2 + 1
elif x % 11 >= 7:
  ans = x // 11 * 2 + 2


print(ans)

Solution (Python):

x = int(input())

if x <= 6:
    print(1)
    exit()
if 6 < x <= 11:
    print(2)
    exit()
ans = (x // 11)
point = ans * 11
ans *= 2


while point < x:
    if ans % 2 == 0:
        point += 6
        ans += 1
    elif ans % 2 == 1:
        point += 5
        ans += 1
print(ans)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

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

Solution (Python):
N = int(input())
if 1 <= N%11 <= 6:
    print(N//11*2+1)
elif 7 <= N%11:
    print(N//11*2+2)
elif N%11==0:
    print(N//11*2)

Solution (Python):
x=int(input())

y=x//11
z=x%11 

if z==0:
  print(2*y)
elif z<=6:
  print(2*y+1)
else:
  print(2*y+2)

Solution (Python):
x = int(input())
ans = (x // 11) * 2
remains = x % 11
if remains != 0:
    ans += 1
if remains > 6:
    ans += 1
print(ans)

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

Solution (Python):
n = int(input())
res = n // 11
res *= 2
n %= 11
if n == 0:
    pass
elif n < 7:
    res += 1
else:
    res += 2
print(res)

Solution (Python):


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

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

Solution (Python):
def solve(n):

  if n <= 6:
    print(1)
    return

  if n <= 11:
    print(2)
    return

  d = n//11
  if n % 11 == 0:
    print(d*2)
    return

  roku = n - (d*11)
  add = 2 if roku - 6 > 0 else 1
  print((d * 2)+add)

   
n = int(input())
solve(n)

Solution (Python):
import sys
read_=sys.stdin.buffer.readline
x=int(read_())
ans=x//11*2
a=x%11

if 0<a<=6:
    print(ans+1)
elif a==0 and ans>0:
    print(ans)
else:
    print(ans+2)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





x=ii()
if x<=6:
    print(1)
    exit()
elif x<=11:
    print(2)
    exit()

ans = (x//11)*2
cnt = x%11

if cnt==0:
    print(ans)
elif cnt<=6:
    print(ans+1)
else:
    print(ans+2)

Solution (Python):
n = int(input())

a = n // 11
b = n % 11

ans = 0

if b >= 1 and b <= 6:
    ans += 1
elif b >= 7 and b <= 10:
    ans += 2

ans += a * 2 

print(ans)

Solution (Python):

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

Solution (Python):


class Proc:
    def __init__(self):
        self.x = int(input().rstrip())

    def get_ans(self):
        if self.x <= 0:
            return 0
        if self.x <= 6:
            return 1
        if self.x <= 11:
            return 2
        ans = int(self.x / 11) * 2
        self.x = self.x % 11
        ans += self.get_ans()
        return ans


print(Proc().get_ans())

Solution (Python):
N=int(input())
count=0
ans=0
tmp=5
if N<11:
	if N<=6:
		print(1)
	else:
		print(2)
else:
	ans=(N//11)*2
	if N%11==0:
		print(ans)
	elif N%11>6:
		print(ans+2)
	else:
		print(ans+1)

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X=I()
    ans = X//11*2
    X%=11
    if 0<X<=6:
        ans += 1
    elif 6<X:
        ans += 2
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
import math
x=int(input())
if x<=6:
    print(1)
    exit()

ans=math.ceil(x/11)*2
if ans//2*11-x>=5:
    ans+=-1

print(ans if x>11 else 2)

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

if 1<=x%11<=6:
  ans+=1
elif 7<=x%11<=10:
  ans+=2
print(ans)

Solution (Python):
def main():
    x = int(input())
    ans = x // 11
    x -= ans * 11
    ans *= 2
    if x <= 0:
        print(ans)
    elif x <= 6:
        print(ans + 1)
    else:
        print(ans + 2)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
n = -(-x//11)
print(2*n-1 if 0<x%11<7 else 2*n)

Solution (Python):

x=int(input())

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

print(ans)

Solution (Python):
x = int(input())
a = x % 11
if a == 0:
    ans = (x // 11) * 2
elif a < 7:
    ans = (x // 11) * 2 + 1
else:
    ans = (x // 11) * 2 + 2
print(ans)

Solution (Python):
N = int(input())

def solve(N):
    if 6 >= N:
        return 1
    
    ans = 0
    a = (N // 11) * 2
    b = N % 11

    if b == 0:
        ans = a
    elif 0 < b <= 6:
        ans = a + 1
    else:
        ans = a + 2
    return ans

print(solve(N))

Solution (Python):
n=int(input())
a=n//11
b=n%11
print(2*a+(b+5)//6)

Solution (Python):
def main():
    x = int(input())
    ans = x//11
    x -= ans*11
    ans *= 2
    if 0 < x <= 6:
        ans += 1
    elif 6 < x:
        ans += 2
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
res = x // 11
mod = x % 11
res*=2
if mod > 6:
    res+=2
elif mod!=0:
    res+=1
print(res)

Solution (Python):

import sys
import math
import os
import itertools
import string
import heapq
from _collections import defaultdict
from functools import lru_cache

class cin():
    def int():
        return int(sys.stdin.readline().rstrip())
    def string():
        return sys.stdin.readline().rstrip()
    def mapInt():
        return [int(x) for x in cin.string().split()]
    def stringList(n):
        return [input() for i in range(n)]
    def intListList(n):
        return [cin.mapInt() for i in range(n)]
    def intColsList(n):
        return [int(input()) for i in range(n)]
        
class Math():
    def gcd(a,b):
        if b == 0:
            return a
        return Math.gcd(b,a % b)
    def lcm(a,b):
        return (a * b) // Math.gcd(a,b)
    def roundUp(a,b):
        return -(-a // b)
    def toUpperMultiple(a,x):
        return Math.roundUp(a,x) * x
    def toLowerMultiple(a,x):
        return (a // x) * x
    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret
    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3,d + 1,2):
            if n % i == 0:
                return False
        return True

MOD = int(1e09) + 7

def main():
    N = cin.int()
    ans = (N // 11) * 2
    if N % 11 == 0:
        ans
    elif N % 11 <= 6:
        ans += 1
    else:
        ans +=2
    print(ans)
    return

if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
ans = x//11*2
p = x % 11
if p > 0:
    p -= 6
    ans += 1
if p > 0:
    p -= 5
    ans += 1
 
print(ans)

Solution (Python):
x = int(input())
ans = x//11*2
p = x-x//11*11
if p > 0:
    p -= 6
    ans += 1
if p > 0:
    p -= 5
    ans += 1

print(ans)

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

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

Solution (Python):
x = int(input())

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

print(ans)

Solution (Python):
x = int(input())

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    x = int(readline())
    cnt = x // 11 * 2
    x %= 11
    if x == 0:
        print(cnt)
    elif 1 <= x <= 6:
        print(cnt + 1)
    elif 7 <= x <= 10:
        print(cnt + 2)


if __name__ == '__main__':
    solve()

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

Solution (Python):
N=int(input())

syo=N//11
amari=N%11
gosa=0
if amari>6:
    gosa=2
if (1<=amari) and (amari<=6):
    gosa=1
print(syo*2+gosa)

Solution (Python):
x = int(input())

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

Solution (Python):

from math import ceil
X = int(input())
if X <= 6:
    print(1)
else:
    mod = X % 11
    if mod >= 7:
        print(X // 11 * 2 + 2)
    elif mod == 0:
        print(X // 11 * 2)
    else:
        print(X // 11 * 2 + 1)

Solution (Python):
x = int(input())
if x % 11 >= 7:
    t = 2
elif x % 11 > 0:
    t = 1
else:
    t = 0
print(x // 11 * 2 + t)

Solution (Python):
x = int(input())
if x % 11 == 0:
    print(x // 11 * 2)
else:
    cnt = x // 11 * 2
    x -= x // 11 * 11
    while x > 0:
        if cnt % 2 == 0:
            x -= 6
        else:
            x -= 5
        cnt += 1
    print(cnt)

Solution (Python):
x = int(input())

ans = (x // 11) * 2
ans += 1 if x % 11 > 6 else 0
ans += 1 if x % 11 > 0 else 0

print(ans)

Solution (Python):

x = int(input())
y = x // 11
if y * 11 != x:
    ans = 1 if x % 11 <= 6 else 2
else:
    ans = 0

print(y * 2 + ans)

Solution (Python):
X = int(input())
A = X // 11
B = X % 11
if B == 0:
    print(A * 2)
elif B <= 6:
    print(A * 2 + 1)
else:
    print(A * 2 + 2)

Solution (Python):
X = int(input())
A = X // 11
B = X % 11
if B == 0:
    print(A * 2)
elif B <= 6:
    print(A * 2 + 1)
else:
    print(A * 2 + 2)

Solution (Python):

from math import ceil

def solve():
    x = int(input())
    res = 2*ceil(x/11) - (0 < x%11 <= 6)
    return str(res)

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

Solution (Python):
x=int(input())
div = x//11
rem = x%11

if(rem==0):
    print(2*div)
elif(rem>6):
    print(2*div+2)
else:
    print(2*div+1)

Solution (Python):
import sys

stdin = sys.stdin
 
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  

X = ri()

if X <= 6:
    print(1)
    exit()
q, r = divmod(X, 11)
answer = 2 * q
if r > 0:
    answer += 1
if r > 6:
    answer += 1
print(answer)

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

Solution (Python):
x = int(input())

n = x//11*2
if x%11>6:
  n += 2
elif x%11>0:
  n += 1

print(n)

Solution (Python):
N = int(input())

mod = 11
ans = 0

if N % mod == 0:
    ans = int(N / mod * 2)
elif N % mod >= 1 and N % mod <= 6:
    ans = N // mod * 2 + 1
else:
    ans = N // mod * 2 + 2

print(ans)

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

Solution (Python):
n=int(input())
num1=(n//11)*2
num2=n%11
if num2==0:
  print(num1)
elif num2>=1 and num2<=6:
  print(num1+1)
else:
  print(num1+2)

Solution (Python):
N = int(input())

X = N // 11
M = N % 11
if M == 0:
    print(X * 2)
elif M > 6:
    print(X * 2 + 2)
else:
    print(X * 2 + 1)

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

Solution (Python):
n=int(input())
print( (n//11)*2 + ((n-11*(n//11))-1)//6 + 1)

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

Solution (Python):
import sys
input = sys.stdin.readline


def main():
    x = int(input())
    d, m = divmod(x, 11)
    print(2*d + int(m > 6) + int(m > 0))


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline


def main():
    x = int(input())
    ans = 2 * (x//11)
    r = x % 11
    if r > 6:
        ans += 2
    elif r > 0:
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x=int(input())
d,m=divmod(x,11)
print(d*2-(-m//6))

Solution (Python):
import sys
x = int(input())


if x <= 6:
    print(1)
    sys.exit()
if x <= 11:
    print(2)
    sys.exit()

div = (x // 11)
modulo = (x % 11)

if 1 <= modulo <= 6:
    print(div * 2 + 1)
elif 6 < modulo:
    print(div * 2 + 2)
elif modulo == 0:
    print(div * 2)

Solution (Python):
x=int(input())
cnt=0
point=x//11
cnt +=point*2
x -=11*point
if 6<x<11:print(cnt+2)
else:print(cnt+1 if 0<x<=6 else cnt)

Solution (Python):
X = int(input())
d,m = divmod(X-1,11)
print(1 + 2*d + (m>=6))

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

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

Solution (Python):
x = int(input())

a, b = divmod(x, 11)

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

Solution (Python):
x=int(input());print(x//11*2+(x%11+5)//6)

Solution (Python):
x=int(input())

ans=x//11*2
ans+=0 if x%11==0 else 1 if x%11<7 else 2

print(ans)

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

Solution (Python):
Q, r = divmod(int(input()), 11)
print(Q*2 - (-r//6))

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

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

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

Solution (Python):
x = int(input())

d, m = divmod(x, 11)

if m == 0:
    print(d * 2)
elif m <= 6:
    print(d * 2 + 1)
else:
    print(d * 2 + 2)

Solution (Python):
N = input()
N = int(N)
ans = (N//11) * 2
N %= 11
if  1<=N <=6:
  ans += 1
  
elif 6<N:
  ans += 2
print(ans)

Solution (Python):
x=int(input())

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

Solution (Python):
X = int(input())

N=((X-1)//11)*2
P=(X-1)%11

if(P>5):
    print(N+2)
else:
    print(N+1)

Solution (Python):
X = int(input())

N=(X//11)*2
P=X%11

if(P>6):
    print(N+2)
elif(P==0):
    print(N)
else:
    print(N+1)

Solution (Python):
x = int(input())
syo = x // 11
amari = x % 11
if amari !=0:
    print(2 * syo + amari // 7 + 1)
else:
    print(2 * syo)

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    x = int(input().rstrip('\n'))
    cnt = (x + 10) // 11 * 2
    if x % 11 <= 6 and x % 11 != 0:
        print(cnt-1)
    else:
        print(cnt)


if __name__ == '__main__':
    slove()

Solution (Python):
x = int(input())

ans = x // 11

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

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

Solution (Python):
x = int(input())

tmp = x//11
tmp *= 2
a = x%11

if a == 0:
    tmp = tmp
elif a <= 6:
    tmp += 1
else:
    tmp += 2

print(tmp)

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

Solution (Python):
N=int(input())
ans=2*((N+10)//11)
r=N%11
if r>0 and r <= 6:
    ans-=1
print(ans)

Solution (Python):


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

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    x = int(input())

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


if __name__ == "__main__":
    main()

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

Solution (Python):
N = int(input())
if N % 11 > 6:
  print((N+10)//11*2)
elif N % 11 == 0:
  print(N//11*2)
else:
  print(N//11*2+1)

Solution (Python):


import sys

n=int(input())



sum=((n//11)*2)
if(n%11>0):
	sum+=((n%11)//7)+1

print(sum)

Solution (Python):
from sys import stdin
x = int(stdin.readline().rstrip())
if x % 11 == 0:
    print(2*(x//11))
elif x%11 > 6:
    print(2*(x//11)+2)
else:
    print(2*(x//11)+1)

Solution (Python):
a = int(input())
print(int((a + 4.5) // 5.5))

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

Solution (Python):
a = int(input())
print(int((a + 4.5) // 5.5))

Solution (Python):
N = int(input())

ans = N // 11
tmp = N - 11 * ans
ans *= 2
if tmp > 6:
    ans += 2
elif tmp > 0:
    ans += 1

print(ans)

Solution (Python):
x = int(input())
div, mod = divmod(x, 11)
if mod == 0:
  ans = div * 2
elif mod <= 6:
  ans = div * 2 + 1
else:
  ans = div * 2 + 2
print(ans)

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

Solution (Python):
n=int(input())-1
print(2*(n//11)+(n%11)//6+1)

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

Solution (Python):
x = int(input())
if (x - x//11*11) == 0:
    ans = x//11*2
else:
    ans = x//11*2 + (x - x//11*11)//7 + 1
print(ans)

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

Solution (Python):
x = int(input())

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

Solution (Python):
x = int(input())
ans = 2 * (x // 11)
print(ans + (x % 11) // 7 + bool(x % 11))

Solution (Python):
import math

x = int(input())
ans = 2 * (x // 11)

print(ans + (x % 11) // 7 + bool(x % 11))

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

Solution (Python):

def main():
    x = int(input())
    ans, r = x // 11 * 2, x % 11  
    if r != 0:
        ans += 1 if x % 11 <= 6 else 2
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):

def main():
    x = int(input())
    ans, r = x // 11 * 2, x % 11
    if r != 0:
        ans = ans + 1 if x % 11 <= 6 else ans + 2
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
ans, rem = divmod(x, 11)
ans *= 2
if 0 < rem <= 6:
    ans += 1
elif 7 <= rem <= 10:
    ans += 2
print(ans)

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

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

Solution (Python):

"""
C - X: Yet Another Die Game
https://atcoder.jp/contests/arc068/tasks/arc068_a

"""
import sys


def solve(x):
    q, r = divmod(x, 11)
    ans = q * 2
    if r:
        ans += 1 if r <= 6 else 2
    return ans


def main(args):
    x = int(input())
    ans = solve(x)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
n=int(input())
print((n+10)//11*2-(0<n%11<7))

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

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

Solution (Python):
x = int(input())

t = x // 11

if 11 * t == x:
    result = 2 * t

elif 11 * t + 6 >= x :
    result = 2 * t + 1

else:
    result = 2 * t + 2
    
print(result)

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

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

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

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

Solution (Python):
dim, mod = divmod(int(input()), 11)
print(dim * 2 + (1 if 7>mod else 2)*(mod>0))

Solution (Python):
x = int(input())

res = 0

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

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

Solution (Python):
x = int(input())


syo = x // 11
amari = x % 11
PiecesOfUsuedNumbers = 2
if amari == 0:
    ans = syo * PiecesOfUsuedNumbers
elif 0 < amari <= 6:
    ans = syo * PiecesOfUsuedNumbers + 1
else:
    ans = syo * PiecesOfUsuedNumbers + 2


print(ans)

Solution (Python):
x = int(input())


syo = x // 11
amari = x % 11
if amari == 0:
    ans = syo * 2
elif 0 < amari <= 6:
    ans = syo * 2 + 1
else:
    ans = syo * 2 + 2


print(ans)

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

Solution (Python):
x = int(input())

ans = (x // 11) * 2
x2 = x - 11 * (ans/2)
if 0 < x2 <= 6:
    ans += 1
elif 7 <= x2:
    ans += 2

print(ans)

Solution (Python):


n = int(input())
trial_num = 0

n_reminder = n % 11

if(n_reminder == 0):
    print(n//11 * 2)
elif(0 < n_reminder <= 6):
    print((n//11)*2 + 1)
elif(7 <= n_reminder <= 11):
    print((n//11)*2 + 2)

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

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

Solution (Python):
x = int(input())
if x<=6:
    print(1)
    exit()
elif x<=11:
    print(2)
    exit()
if x%11>6:
    print((x//11)*2+2)
else:
    print((x//11)*2+min(1,x%11))

Solution (Python):
x =  int(input())

if x % 11 == 0:
    print((x // 11) * 2)

elif x % 11 >= 1 and x % 11 <= 6:
    print((x // 11) * 2 + 1)

else:
    print((x // 11) * 2 + 2)

Solution (Python):
x = int(input())

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

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

Solution (Python):
n=int(input());print(n//11*2+1+(n%11>6)-(n%11==0))