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: Accepted

Solution code:
x = int(input())

cnt = (x//11)*2

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

Submission status: Accepted

Solution code:
x = int(input())

q = (x-1)//11
r = (x-1)%11

if r>5:
    ans = q*2 + 2
else:
    ans = q*2 + 1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n=I()
  if n-6<=0:
    return 1

  n-=6
  c=1
  return int(c+(-(-n//5.5)))

print(main())

Submission status: Accepted

Solution code:
## 6点、5点を繰り返すのが最適

x = int(input())

ans = 2 * ((x - 1) // 11) + ((x - 1) % 11 > 5) + 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
#6点5点を交互に得れば良い

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

Submission status: Accepted

Solution code:
print((2*input()+9)/11)

Submission status: Accepted

Solution code:
import math
X = int(input())
if(X<7):
    print(1)
else:
    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: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

cnt = (n // 11)  * 2
n %= 11

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

Submission status: Accepted

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

ans = (N //11)*2
nokori = N % 11
ans += math.ceil(nokori/6)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
print(a//11*2+[0,1,2][((a%11)+5)//6])

Submission status: Accepted

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

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if _buff >= 7:
    print(int(count*2+2))
    exit()
elif 7 >= se and se > 0:
    print(int(count*2+1))
    exit()
    
print(int(count*2))

Submission status: Accepted

Solution code:
n = int(input())

a = (n // 11) *2

b = n % 11

c = 0
if 7 > b > 0:
	c = 1
elif b >= 7:
	c = 2
print(a+c)

Submission status: Accepted

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

Submission status: Accepted

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

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

    """
    x点以上になる最小操作回数。初期状態は自由。
    6と5を交互に繰り返すだけで良くない？

    計算量はO(1)
    """

    # 6と5を何回繰り返せばよいか？
    ans = (x//11) * 2
    restX = x%11

    # 上面を6にする
    if restX > 0:
        restX -= 6
        ans += 1

    # 上面を5にする
    if restX > 0:
        ans += 1
    
    print(ans)


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

t = N % 11
p = N // 11 * 2

if t != 0 and t < 7:
    t = 1
elif t != 0:
    t = 2
    
print(p + t)

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

x = int(input())

cnt = (x // 11)*2

if x % 11 == 0:
    ans = cnt
elif x % 11 > 6:
    ans = cnt + 2
else:
    ans = cnt + 1

print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

if x>6:
    print(ans+2)
elif x>0:
    print(ans+1)
else:
    print(ans)

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x = f()[0]
    ans = (x//11)*2 
    remain = x%11
    add = 0
    if remain!=0:
        add = (2 if remain >6 else 1)
    
    print(ans + add)

solve()

Submission status: Accepted

Solution code:
import math

x = int(input())

ans = math.ceil(x/11) + int(x/11)

if x%11 == 0:
    pass
elif x-11*int(x/11) >= 7:
    ans = ans + 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

num = (x // 11) * 2
amari = x % 11

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

ans = (x // 11) * 2

if x % 11 > 6:
    ans += 2
elif x % 11 > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

def solve(x):
    q = x // 11
    r = x % 11
    
    if(r == 0):
        s = 0
    elif(r <= 6):
        s = 1
    else:
        s = 2
    
    print(q*2 + s)
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
def main():
	x = int(input())
	rest = x
	dev = rest//11
	rest -= (dev)*11
	ans = 2*dev
	if rest > 0:
		if rest > 6:
			ans += 2
		else:
			ans += 1
	print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


def read_input():
    x = int(input())
    return x


def submit():
    x = read_input()

    a = x // 11
    b = x % 11

    c = 2 * a

    if b > 0:
        if b <= 6:
            c += 1
        else:
            c += 2

    print(c)


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
x = int(input())

ans = 0
if x // 11:
    ans += x // 11 * 2
    pt = x // 11 * 11
    x -= pt

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

Submission status: Accepted

Solution code:
x = int(input())

tim = (x * 2 - 1) / 11
tim2 = (x * 2 - 1) // 11
if tim != tim2:
    tim2 += 1

print(tim2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

x=_I()
#6,5の繰り返し

rest=x%11
x-=rest
ans =int((x/11)*2)
if rest==0:
	print(ans)
	exit()

if rest <=6:
	ans +=1
else:
	ans+=2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
cnt=0
x=n//11
a=n%11
cnt+=2*x

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# X: Yet Another Die Game
def main() :
    n = int(input())

    ans = 0
    ans += (n // 11 * 2)

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

def main():
    x = input()
    ans = (x /11)*2
    if 0 < x%11 < 7:
        ans = ans + 1
    elif 7 <= x%11 < 11:
        ans = ans + 2
                
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = int(input())

div, mod = divmod(x, 11)

div = div*2
if mod == 0:
    pass
elif mod <= 6:
    div = div + 1
else:
    div = div + 2

print(div)

Submission status: Accepted

Solution code:
import math
# 1 -> 5 -> 6

x = int(input())

if x <= 6:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        pass
    elif temp <= 6:
        ans += 1
    elif temp >= 5:
        ans += 2

    print(ans + int(math.floor(x / 11)) * 2)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    x = int(input())

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
x=int(n/11*2)
if n % 11 in [0, 6]:
  print(x)
else:
  print(x+1)

Submission status: Accepted

Solution code:
X = int(input())

m = X % 11
c = (X // 11) * 2 + (m != 0) + (6 < m)
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def x_yet_another_die_game(x: int)->int:
    n = x // 11
    if x == n * 11:
        return 2 * n
    if x <= n * 11 + 6:
        return 2 * n + 1
    return 2 * n + 2


if __name__ == "__main__":
    x = int(input())
    ans = x_yet_another_die_game(x)
    print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if x == 0:
    print(count)
elif x <= 6:
    print(count+1)
else:
    print(count+2)

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = int(input())


temp = x // 11
move = temp * 2
if x % 11 == 0:
    pass
else:
    move += 1
    if x % 11 > 6:
        move += 1

print(move)

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
x=int(input())
sevens=x//11
six=x%11
print(2*sevens+(six%11!=0)+six//7)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

temp = int(input())/5.5
syousuu = temp - math.floor(temp)
if syousuu < 0.1 and syousuu > 0.0001:
    print(-1 + math.ceil(temp))
else:
    print(math.ceil(temp))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
if x<=6:
  print(1)
elif (x-6)%5.5==0:
  print(int(-(-x//5.5))-1)
else:
  print(int(-(-x//5.5)))

Submission status: Accepted

Solution code:
x = input()
print x/11*2 + [0,1,1,1,1,1,1,2,2,2,2][x%11]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

a = int(n / 11)


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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
x=int(input())
a,b=divmod(x,11)
if b==0:c=0
else:c=1+(b-1)//6
print(2*a+c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(((int(input())-1)*2//11)+1)

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
#以下てんぷら
def j(q):
    if q==1: print("YES")
    else:print("NO")
    exit(0)


def ct(x,y):
    if (x>y):print("GREATER")
    elif (x<y): print("LESS")
    else: print("EQUAL")

def ip():
    return int(input())
n = ip()                                     #入力整数1つ
#n,x= (int(i) for i in input().split())       #入力整数横2つ以上
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)
#a=[input() for i in range(h)]
#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
#こっから本文
s = (n//11)*2
r = n%11
if r:
    s+=1
    if r>6: s+=1
print(s)

Submission status: Accepted

Solution code:
x = int(input())
count = 0
q, mod = divmod(x, 11)
count += q*2
if(mod == 0):
    pass
elif(mod <= 6):
    count += 1
else:
    count += 2
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A

#B

#C
x = I()
ans = 2*(x//11)+1
x %= 11
if x == 0:
    ans -= 1
if x > 6:
    ans += 1
print(ans)
#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

Submission status: Accepted

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

if x % 11 >= 7:
    ans += 2
elif x % 11 > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def fun():
     print('ac')
     print('AC')
     print('ACAC')
     print('ac')
     print('aacc')
n=eval(input())
if n<=6:
     print(1)
elif n<=11:
     print(2)
elif n<=17:
     print(3)
else:
     k=n//11
     if n%11==0:
          print(2*k)
     else:
          if 11*k+6>=n:
               print(2*k+1)
          else:
               print(2*k+2)

Submission status: Accepted

Solution code:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = map(int,input().split())   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = list(map(int,input().split()))	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]


from collections import defaultdict, Counter
import math
from bisect import bisect_left, bisect_right
import numpy as np

#### START
x = int(input())

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
r,m=divmod(x,11)
print(r*2+-(-m//6))

Submission status: Accepted

Solution code:
x = int(input())

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

if rem > 6:
    ans += 2
elif rem > 0:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:

def solve(x):
    ans = (x // 11) * 2
    x -= (ans // 2) * 11
    if x == 0:
        return ans
    elif x <= 6:
        return ans + 1
    else:
        return ans + 2


if __name__ == "__main__":
    x = int(input())
    print(solve(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
x = int(input())
i = 1 if (x-1) % 11 > 5 else 0
print(2 * ceil(x/11) + i - 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
s = (a//11)*2
if 0<a%11<= 6:
    s+=1
elif 7<=a%11 <=10:
    s+=2
print(s)

Submission status: Accepted

Solution code:
n = int(input())

t = (n // 11) * 2
mod = n % 11
if mod == 0:
    pass
elif 1 <= mod <= 6:
    t += 1
else:
    t += 2

print(t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = int(input())

print(ceil(2*x-1, 11))

Submission status: Accepted

Solution code:
X = int(input())
ans = (X//11)*2
if X%11==0:
    ans += 0
elif X%11<7:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Accepted

Solution code:
x=int(input())

ans=(x//11)*2

if x%11>=7:
    ans+=2
elif x%11==0:
    ans+=0
else:
    ans+=1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_x = int(input())

count = 0

count = (int_x // 11) * 2

if int_x % 11 != 0:
    if (int_x % 11) > 6:
        count += 2
    else:
        count += 1


print(count)

Submission status: Accepted

Solution code:
N = int(input())
sum = 0
count = 0
a = N // 11
x = N - 11 * a
if x == 0:
    x = 0
elif x < 7:
    x = 1
else:
    x = 2

print(2*a + x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = int(input())
n = x // 11
d = x % 11

if d == 0:
    print(2*n)
elif d < 7:
    print(2*n+1)
else:
    print(2*(n+1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from math import ceil
x = int(input())
a = x//11
b = x%11
c = ceil(b/6)
print(2*a + c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
# encoding: utf-8
x = int(input())

dice = [6, 5]

score_tmp = x - (x % 11)
ans = (score_tmp // 11) * 2

for i in range(2):
    if score_tmp >= x: break
    score_tmp += dice[i % 2]
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
# 要するに6+5+6+5...>=xとなる最小数
count = 0
div = int(x/11)
count += div * 2
if x == div * 11:
    print(count)
elif x <= div * 11 + 6:
    print(count + 1)
else:
    print(count + 2)