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:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


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

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

    if remainder <= 6:
        ans += 1
    else:
        ans += 2

    print(ans)


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
ans=0
ans+=x//11*2
if x%11<6:
  ans+=1
elif x%11>5:
  ans+=2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
count = 0
count += n // 11
count *= 2  
n = n % 11
if n:
    count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

remain = n%11
ans = (n//11)*2
ans += 2 if remain > 6 else 1
print(ans)

Submission status: Wrong Answer

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

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 = x//11*2
b = x%11
if b == 0:
    print(a)
elif b <= 5:
    print(1 + a )
else:
    print(2 + a)

Submission status: Wrong Answer

Solution code:
x = int(input())

s = int(x/11)
r = x % 11

if r > 6:
    print(2*s + 2)
else:
    print(2*s + 1)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n/11 == int(n/11):
     a = n/11
     print(int(2*a))
else:
    a = int(n/11)
    # a+1 の帯に入る
    if n <= 11*a+5:
        print(int(2*(a+1)-1))
    else:
        print(int(2*(a+1)))

Submission status: Wrong Answer

Solution code:
n = int(input())

if n/11 == int(n/11):
     a = n/11
     print(int(2*a))
     
else:
    a = int(n/11)
    # int(n/11)+1 の帯に入る
    if n <= 11*a+5:
        print(int(2*(a+1)-1))
    else:
        print(int(2*(a+1)))

Submission status: Wrong Answer

Solution code:
n = int(input())

if n/11 == int(n/11):
     a = n/11
     # n/11の帯に入る
     if n <= 11*(a-1)+5:
         print(int(2*a-1))
     else:
         print(int(2*a))
else:
    a = int(n/11)
    # int(n/11)+1 の帯に入る
    if n <= 11*(a-1):
        print(int(2*(a+1)-1))
    else:
        print(int(2*(a+1)))

Submission status: Wrong Answer

Solution code:
n = int(input())

if n/11 == int(n/11):
     a = n/11
     
     if n <= 11*(a-1)+5:
         print(int(2*a-1))
     else:
         print(int(2*a))
else:
    a = int(n/11)
    
    if n <= 11*(a-1):
        print(int(2*(a+1)-1))
    else:
        print(int(2*(a+1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = x//11
i = x%11

if i <= 5:
    print(2*cnt+1)
else:
    print(2*cnt+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = (x // 11 + 1) * 2

if 11*tmp//2 - 5 >= x:
    ans = tmp -1
else:
    ans = tmp

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = (x // 11 + 1) * 2

if 6* tmp//2 + 5*(tmp // 2 - 1) >= x:
    ans = tmp -1
else:
    ans = tmp

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
import sys
x=int(input())
i=0
cnt=0
cnt+=(x//11)*2
x%=11
if x==0:
    print(cnt)
    sys.exit()
while x>0:
    x-=6
    cnt+=1
    if x<0:
        break
    if (x-5)<=0:
        cnt+=1
        break
    else:
        x-=5
        cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
import sys
x=int(input())
i=0
cnt=0
cnt+=(x//11)*2
x-=cnt*11/2
if x==0:
    print(cnt)
    sys.exit()
while x>0:
    x-=6
    cnt+=1
    if x<0:
        break
    if (x-5)<=0:
        cnt+=1
        break
    else:
        x-=5
        cnt+=1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
if x <= 1:
    print(0)
elif x < 6:
    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: Wrong Answer

Solution code:
x = int(input())
if x == 0:
    print(0)
elif x < 6:
    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: Wrong Answer

Solution code:
x = int(input())
if x == 0:
    print(0)
elif 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())
ans=2*(x//11)
a=ans*11//2
while a<=x:
    a+=5
    ans+=1
    if a>=x:
        break
    a+=6
    ans+=1
    if a>=x:
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8


import math


n = int(input())
print(math.ceil(n/11*2))

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
if x <= 6:
    print(1)
    
elif 7<=x<=11:
    print(2)
    
else:
    t = (x%11)
    if  t<=6:
        print(2*(x//11)+1)
    elif 7 <= t <= 10:
        print(2*(x//11)+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())
if 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==0:
    a=int(x/11*2)
elif x%11/6>1:
    a=int(x/11*2)+2
else:
    a=int(x/11*2)+1
print(a)

Submission status: Wrong Answer

Solution code:

x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x//11)*2

if x - (x//11)*11 <= 5:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x//11)*2

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x//11)*2+2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

      
print(ans)
"""

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

      
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = n // 11 * 2
if n % 11 >= 5:
    ans += 2
elif n % 11 >= 1:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())
if N > 6:
    P = int(N / 11)
    Q = N % 11
    if Q > 6:
        R = 2
    elif Q > 0 and 6 > Q:
        R = 1
    else:
        R = 0
    print(P * 2 + R)
else:
    print(1)

Submission status: Wrong Answer

Solution code:
N = int(input())
if N > 6:
    P = int(N / 11)
    Q = N % 11
    if Q > 6:
        R = 2
    else:
        R = 1
    print(P * 2 + R)
else:
    print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

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())
ans = x//11*2
if x != 0:
    if x <= 6:
        ans += 1
    else:
        ans += 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def main():
    x = int(input())
    result = x * 2 // 11

    if x * 2 % 11 != 0:
        result += 1

    print(result)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

rem = (x-1) % 11

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

Submission status: Wrong Answer

Solution code:
x = int(input())

rem = (x-1) % 11

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
'''
6が側面に来るようにして、6,5を繰り返す
'''
x = int(input())
cnt = 0
cnt += (x // 11) * 2
if (x % 11) <= 6:
    cnt += 1
else:
    cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

n = x//11
r = x%11

if r > 6:
    print(2*n+2)
else:
    print(2*n+1)

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
print(math.ceil(x /11 *2) if x > 11 else 1 if x <= 6 else 2)

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((x//11)*2+(x%11)//6+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

if x < 7 :
    print(1)
elif x < 12 :
    print(2)
else :
    print(x // 11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
import sys
def main():
    x = input()
    x = int(x)

    ans = 0

    x = x - 5
    ans += 1

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

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

if __name__ == "__main__":
        main()

Submission status: Wrong Answer

Solution code:

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

    ans = 0

    x = x - 5
    ans += 1

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

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

    ans += 1

    print(ans)

if __name__ == "__main__":
        main()

Submission status: Wrong Answer

Solution code:

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

    ans = 0

    x = x - 5
    ans += 1

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

    ans += x//6
    x = x % 6

    ans += 1

    print(ans)

if __name__ == "__main__":
        main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.ceil(i / 6))

Submission status: Wrong Answer

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

print(math.ceil(i / 11))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
if x < 7:
    print(1)
else:
    a,b = divmod(x, 11)
    if b < 7:
        print(a*2+1)
    else:
        print(a*2+2)

Submission status: Wrong Answer

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

print(m())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

s = n % 11
p = n // 11

if s == 0:
    print(2*p)
elif 1 <= s and s <= 5:
    print(2*p+1)
else:
    print(2*p+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

t = 0
t += x // 11 * 2

a = x % 11
if 1 <= a <= 5:
    t += 1
elif 6 <= a <= 10:
    t += 2

print(t)

Submission status: Wrong Answer

Solution code:
# 6,5の面を順に出し続けるのが最善
x = int(input())
tmp = x // 11 # 6,5の面を出したセット数
if tmp + 5 >= x: # 5の面をさらに1度出す
  ans = tmp * 2 + 1
else: # 6の面もさらに1度出す
  ans = tmp * 2 + 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
j=math.floor(a/11)
if a==j:
  j=j*2
elif a - j * 11<=6:
  j=j*2+1
else:
  j=j*2+2
print(j)

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
j=math.floor(a/11-0.001)

if a - j * 11<=6:
  j=j*2+1
else:
  j=j*2+2
print(j )

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
j=math.floor(a/11)
if a-j*11<=6:
  j=j*2+1
else:
  j=j*2+2
print(j )

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
j=math.ceil(a/11*2)
if a-j<=6/11:
  j-=1
print(j )

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
j=math.ceil(a/11*2)
if a-j<=5/11:
  j-=1
print(j )

Submission status: Wrong Answer

Solution code:
x=int(input())
x-=1
ans=(x//11)*2
tmp=x%11

if tmp==0:
    print(ans)
    exit()

if tmp<=5:
    ans+=1
elif tmp<11:
    ans+=2
print(ans)

Submission status: Wrong Answer

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

if tmp==0:
    print(ans)
    exit()

if tmp<=5:
    ans+=1
elif tmp<11:
    ans+=2
print(ans)

Submission status: Wrong Answer

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

if tmp<=5:
    ans+=1
elif tmp<11:
    ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())
print(int(a//5.5)+(a%11-1)//6 + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

y = int(x / 11)
if 0< x - y * 11 < 7:
    print(2 * y + 1)
elif x-y*11 == 0:
    print(2*y)
else:
    print(2 * (y + 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
M=N//11
A=N-11*M
if A<=6:
    print(2*M+1)
else:
    print(2*M+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
    ans = 1
elif 7 <= n <= 11:
    ans = 2
else:
    a = n // 11
    b = n % 11
    if b == 0:
        ans = a*2
    elif 1 <= b <= 5:
        ans = a*2 + 1
    else:
        ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
    ans = 1
elif 7 <= n <= 12:
    ans = 2
else:
    a = n // 11
    b = n % 11
    if b == 0:
        ans = a*2
    elif 1 <= b <= 6:
        ans = a*2 + 1
    else:
        ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
    ans = 1
elif 7 <= n <= 12:
    ans = 2
else:
    a = n // 11
    b = n - a * 11
    if b == 0:
        ans = a*2
    elif 1 <= b <= 5:
        ans = a*2 + 1
    else:
        ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
    ans = 1
elif 7 <= n <= 12:
    ans = 2
else:
    a = n // 11
    b = n % 11
    if b == 0:
        ans = a*2
    elif 1 <= b <= 5:
        ans = a*2 + 1
    else:
        ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n <= 6:
    ans = 1
elif 7 <= n <= 12:
    ans = 2
else:
    a = n // 11
    b = n % 11
    if b <= 5:
        ans = a*2 + 1
    else:
        ans = a*2 + 2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = int(input())
print((i-1)//6+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())
count=x//11
if x<=count*11+6 and x<=count*11+10:
    print(min(count*2+1,count*2+2))
elif x<=count*11+6:
    print(count*2+1)
else:
    print(count*2+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
count=x//11
if x<=count*11+6 and x<=count*11+5:
    print(min(count*2+1,count*2+2))
elif x<=count*11+5:
    print(count*2+1)
else:
    print(count*2+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()
cnt=N/11*2
amari=N%11
if 0<amari and amari<=6:
	cnt+=1
else:
	cnt+=2
print cnt

Submission status: Wrong Answer

Solution code:
import math

num = int(input())

res = num*2/11

print(int(res) if res % 1 < 1 else res+1)

Submission status: Wrong Answer

Solution code:
import math

num = int(input())

print(math.ceil(num*2/11) if num != 6 else 1)

Submission status: Wrong Answer

Solution code:
import math

num = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())
dice = [0, 6, 5, 4, 3, 2, 1]
sum_ = idx = 1
cnt = 0
while sum_ <= x:
    tmp = dice[:]
    tmp[idx], tmp[7-idx] = 0, 0
    idx = tmp.index(max(tmp))
    sum_ += dice[idx]
    cnt += 1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()
time=a/11*2

if a-11*time/2==0:
	pass
elif a-11*time/2>=6:
	time+=2
else:
	time+=1

print time

Submission status: Wrong Answer

Solution code:
a=input()
a-=1
time=a/11*2

if a-11*time/2==0:
	time+=1
elif a-11*(time/2-1)>=6:
	time+=2
else:
	time+=1

print time

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if x <= 6:
    print(1)
elif x<= 11:
    print(2)
else:
    z = x%11
    if z <= 6:
        print((math.ceil(x/11)*2)-1)
    elif z <= 11:
        print(math.ceil(x/11)*2)

Submission status: Wrong Answer

Solution code:
x = int(input())

sho = x // 11
ama = x % 11

count = 2 * sho
if 0 < ama and ama < 10 :
    if ama > 5:
        count += 2
    else:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

sho = x // 11
ama = x % 11

count = 2 * sho
if 0 < ama and ama < 10 :
    if ama > 6:
        count += 2
    else:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
x = int(input())
y = 0
y += x // 11 * 2
x %= 11
if x >= 1:
    y += 1
    x -= 5
    if x >= 1:
        y += 1
        x -= 6
assert x <= 0
print(y)

Submission status: Wrong Answer

Solution code:
N=int(input())
m=int(N/11)
r=N-m
if r==0:
  print(2*m)
elif r<7:
  print(2*m+1)
else:
  print(2*m+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
x = input()
q = (x/11)*2
r = x-11*q
if(r<=6):
    print(q+1)
else:
    print(q+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    x = int(input())
    print(2*(x//11)+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x//11
b = x - 11*a
c = 0
if b <=6 and b >0:
    c = 1
else:
    c = 2

print(2*a + c)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x//11
b = x - 11*a
c = 0
if b <=6:
    c = 1
else:
    c = 2

print(2*a + c)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x//11
b = x - 11*a
if b <=6:
    c = 1
else:
    c = 2

print(2*a + c)