A Martian boy is named *s* — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more letters (at that, the remaining letters remain in the same order), he gets happy. For example, if *s*=«aba», then strings «baobab», «aabbaa», «helloabahello» make him very happy and strings «aab», «baaa» and «helloabhello» do not.

However rather than being happy once, he loves twice as much being happy twice! So, when he got string *t* as a present, he wanted to cut it in two parts (the left part and the right part) so that each part made him happy.

Help *s* determine the number of distinct ways to cut the given string *t* into two parts in the required manner.
The first line contains string *s*, consisting of lowercase English letters. The length of string *s* is from 1 to 1000 letters.

The second line contains string *t*, that also consists of lowercase English letters. The length of string *t* is from 1 to 10<sup class="upper-index">6</sup> letters.
from collections import Counter
import string
import math
import sys
from fractions import Fraction
def array_int():
    return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
    if arrber_of_variables==1:
        return int(sys.stdin.readline())
    if arrber_of_variables>=2:
        return map(int,sys.stdin.readline().split()) 
def makedict(var):
    return dict(Counter(var))
# i am noob wanted to be better and trying hard for that
def printDivisors(n): 
    divisors=[]  
    # Note that this loop runs till square root 
    i = 1
    while i <= math.sqrt(n): 
          
        if (n % i == 0) : 
              
            # If divisors are equal, print only one 
            if (n//i == i) : 
                divisors.append(i) 
            else : 
                # Otherwise print both 
                divisors.extend((i,n//i)) 
        i = i + 1
    return divisors

def countTotalBits(num):
     
     # convert number into it's binary and 
     # remove first two characters 0b.
     binary = bin(num)[2:]
     return(len(binary))
def isPrime(n) : 
  
    # Corner cases 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    # This is checked so that we can skip  
    # middle five numbers in below loop 
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True
# print(math.gcd(3,2))
""" def dfs(node,val):
    global tree,visited
    visited[node]=1
    ans[node]=val
    val^=1
    for i in tree[node]:
        if visited[i]==-1:
            dfs(i,val) """
s=input()
t=input()
m=len(s)
n=len(t)
j=0
flag=0
for i in range(n):
    if j>=m:
        break
    if t[i]==s[j]:
        j+=1
        continue
if j!=m:
    print(0)
else:
    # print(i)
    p=m-1
    flag=0
    for k in range(n-1,i,-1):
        
        if t[k]==s[p]:
            if p==0:
                flag=1
                break
            p-=1
    # print(k)
    # print(flag)
    if flag!=1:
        print(0)
    else:
        print(k-(i-1))
            



        





        


    
        






        
    
        
    
        
    

	



                






    
    

    
    


    

    



    


    














        

    

            
    





        
        
   
