// Java implementation of Kosaraju's algorithm to print all SCCs
import java.io.*;
import java.util.*;
import java.util.LinkedList;

// This class represents a directed graph using adjacency list
// representation
public class Main
{ // Driver method
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    }
} import java.io.*; io.* java import java.util.*; util.* java import java.util.LinkedList; LinkedList java.util public class Main
{ // Driver method
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    }
} Main public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    } main {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    } Scanner in=new Scanner(System.in); in new Scanner(System.in) String str=in.nextLine(); str in.nextLine() in.nextLine in int ans=0; ans 0 for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        } int i = 0; int i = 0; i 0 i <str.length() i str.length() str.length str i++ i++ i {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        } {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        } if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            } str.charAt(i)=='+' str.charAt(i) str.charAt str i '+' {
                ans++;
            } ans++ ans {
                ans--;
            } ans-- ans System.out.println(ans) System.out.println System.out System System.out ans String args[] args public class Main
{ // Driver method
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    }
} public class Main
{ // Driver method
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    }
} Main
// Java implementation of Kosaraju's algorithm to print all SCCs
import java.io.*;
import java.util.*;
import java.util.LinkedList;

// This class represents a directed graph using adjacency list
// representation
public class Main
{ // Driver method
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        int ans=0;
        for (int i = 0; i <str.length(); i++) {
            if(str.charAt(i)=='+'){
                ans++;
            }else{
                ans--;
            }
        }
        System.out.println(ans);

    }
}