平衡数

	a=raw_input()



	flag=False



	iflen(a)==1:



	    print('NO')



	else:



	    fori in range(len(a)):



	        number=1



	        number1=1



	        forj in range(0,i+1):



	            number=number*int(a[j])



	 



	        forj in range(i+1,len(a)):



	            number1=number1*int(a[j])



	 



	         



	        ifnumber==number1:



	            flag=True



	     



	    if(flag==True):



	        print('YES')



	    else:



	        print('NO')

import java.util.Scanner;
import java.lang.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int number;				
		int r1;
		int r2;
		while(in.hasNext())
		{
			boolean PHS = false;
			number = in.nextInt();
			String str = String.valueOf(number);
			if (number>=10)
			{
				for (int i = 0; i<str.length()-1; i++)
				{
					r1 = 1;
					r2 = 1;
					for (int j = 0; j<=i;j++)
					{
						String perstr1 = str.substring(j,j+1);
						int num1 = Integer.parseInt(perstr1);
						r1 = r1 * num1;
					}
					for (int k = i+1;k<str.length();k++)
					{
						String perstr2 = str.substring(k,k+1);
						int num2 = Integer.parseInt(perstr2);
						r2 = r2 * num2;
					}
					if (r1 == r2)
					{
						PHS = true;
						break;
					}
				}
				if (PHS)
				{
					System.out.println("YES");
				}
				else
				{
					System.out.println("NO");
				}
			}
			else
			{
				System.out.println("NO");
			}
		}		
	}
}

#include<iostream>
using namespace std;

int function(int n){
	int sum[15], i = 0, j = 0;
	while (n){
		sum[i] = n % 10;
		n /= 10;
		i++;
	}
	if (--i <= 0)
		return 0;
	int left = sum[j], right = sum[i];
	while (j < i - 1){    //线性遍历
		if (left <= right && left != 0)
			left *= sum[++j];
		else
			right *= sum[--i];
	}
	if (left == right)
		return 1;
	else
		return 0;
}
int main(){
	int n;
	while (cin >> n){
		if (function(n) == 1)
			cout << "YES";
		else
			cout << "NO";
	}
	return 0;
}//时间复杂度为O（n的位数）

//

//  323t1.cpp

//

//

//  Created byyori  on 17/3/23.

//

//

#include <stdio.h>

#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

int main(){

    int n;

    while (cin>>n){

        bool flag = 0 ;

        vector< int > vec;

        int count = 0 ;

        while (n) {

            count++;

            vec.push_back(n% 10 );

            n/= 10 ;

        }

        if (count < 2 ){

            cout<< "NO" <<endl;

            break ;

        }

        cout<<count<<endl;

        reverse(vec.begin(),vec.end());

        for ( int i = 1 ;i < count;i++){

            vector< int > leftvec(vec.begin(),vec.begin()+i),rightvec(vec.begin()+i,vec.end());

            int left = 1 ,right = 1 ;

            for ( int j = 0 ;j < leftvec.size();j++)

                left *= leftvec[j];

            for ( int j = 0 ;j < rightvec.size();j++)

                right *= rightvec[j];

            if (left == right){

                cout<< "YES" <<endl;

                flag = 1 ;

                break ;

            }

        }

        if (!flag)

            cout<< "NO" <<endl;

    }

}

import java.util.Scanner;

/**
 * Created by Scruel on 2017/3/23.
 * Personal blog : http://blog.csdn.net/scruelt
 * Github : https://github.com/scruel
 */
public class BalanceString {
        public static void main(String[] args) {

                Scanner input = new Scanner(System.in);
                int n = input.nextInt();
                String s = String.valueOf(n);
                if (s.length() < 2) {
                        System.out.println("NO");
                        return;
                }
                char[] chars = s.toCharArray();
//                System.out.println(s);

                int[] sum1 = new int[chars.length];
                sum1[0] = chars[0] - 48;
                for (int i = 1; i < chars.length; i++) {
                        sum1[i] = (chars[i] - 48) * sum1[i - 1];
                }
                int[] sum2 = new int[chars.length];
                sum2[0] = chars[chars.length - 1] - 48;
                for (int i = 1; i < chars.length; i++) {
                        sum2[i] = (chars[chars.length - i - 1] - 48) * sum2[i - 1];
                }
                int p = chars.length - 1, q = chars.length - 1;
                while (p >= 0 && q >= 0) {
                        if (sum1[p] < sum2[q]) {
                                q--;
                        } else if (sum1[p] > sum2[q]) {
                                p--;
                        } else if (p + q == chars.length - 2) {
                                System.out.println("YES");
                                return;
                        } else {
                                int tempP = p;
                                int tempQ = q;
                                while (tempP >= 0) {
                                        if (sum1[tempP] != sum2[q])
                                                break;
                                        else if (tempP + q == chars.length - 2) {
                                                System.out.println("YES");
                                                return;
                                        } else {
                                                tempP--;
                                        }
                                }
                                while (tempQ >= 0) {
                                        if (sum1[p] != sum2[tempQ])
                                                break;
                                        else if (p + tempQ == chars.length - 2) {
                                                System.out.println("YES");
                                                return;
                                        } else {
                                                tempQ--;
                                        }
                                }
                                q--;
                                p--;
                        }
                }
                System.out.println("NO");
        }
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int temp;
	while(cin>>temp)
	{
		
		vector<int > vec;
		while(temp)
		{
			int aa;
			aa=temp%10;
			vec.push_back(aa); //按位放入数组中
			temp=temp/10;
		}
		int n=vec.size();
		int i=0;
		int bValue=1;
		int eValue=1;
		int flag=0;
		for(i=1;i<n-1;i++)
		{
			for(int j=0;j<=i-1;j++) //计算前部分的乘积
			{
				
				bValue=bValue*vec[j];
			}
			for(int k=n-1;k>=i;k--)//计算后部分的乘积

			{
				
				eValue=eValue*vec[k];
			}
			if(eValue==bValue ) //相等则输出“YES”
			{
				cout<<"YES"<<endl;
				flag=1;
				break;
			}
			eValue=1; //每次运算将乘积初始化
			bValue=1;
		}
		if(flag==0)
		{
			cout<<"NO"<<endl; //不成功输出“NO”
		}

	}
	return 0;
}

#include <iostream>
#include<vector>
using namespace std;

int main() {
    int a;
    cin>>a;
    if(a<10){//个位数直接判否
        cout<<"NO";
        return 0;
    }
    vector<int> ans;
    int cout0=0;//记录各个位上的0的个数
    
    //按位存入vector
    while(a){
        int cur = a%10;
        if(!cur)cout0++;
        if(cout0==2){//至少两个0，直接判是
            cout<<"YES";
            return 0;
        }
        ans.push_back(cur);
        a/=10;
    }
    if(cout0==1){//只有一个0，直接判否
        cout<<"NO";
        return 0;
    }
    int i=0, j=ans.size()-1;
    int sum1=ans[i], sum2=ans[j];
    //双指针两头向中间处理
    while(i<j){
        if(i+1==j){//指针相遇，结束循环
            break;
        }
        if(sum1<sum2){
            sum1*=ans[++i];
        }else if(sum1>sum2){
            sum2*=ans[--j];
        }else {
            if(i+2==j){//双指针之间还有一个数未遍历
                sum1*=ans[++i];
            }else {
                sum1*=ans[++i];
                sum2*=ans[--j];
            
            }
        
        }
    }
    if(sum1==sum2)cout<<"YES";
    else cout<<"NO";
}

import sys
try:
    while True:
        a = input()
        z = 'NO'
        if len(a) == 1:
            print('NO')
        else:
            for i in range(len(a)):
                m = 1
                n = 1
                for j in a[:i]:
                    m *= int(j)
                for k in a[i:]:
                    n *= int(k)
                if m == n:
                    z = 'YES'
                    break
            print(z)
except:
    pass

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String str = sc.nextLine();
            if(str.length() <2){
                System.out.println("NO");
            }else{
                boolean flag = false;
                int length = str.length();
                for(int i=1;i<length;i++){//长度在1~length-1之间
                    int leftMul = 1;
                    int rightMul = 1;
                    for(int j=0;j<i;j++){//左右两边的断点在i位置，所以左边为0~i-1,右边为i~length-1。
                        leftMul *= Integer.parseInt(str.substring(j,j+1)); 
                    }
                    for(int k=i;k<length;k++){
                        rightMul *= Integer.parseInt(str.substring(k,k+1));
                    }
                    if(leftMul == rightMul){
                        flag = true;
                        break;
                    }
                }
                System.out.println(flag?"YES":"NO");
            }
        }
        sc.close();
    }
}

int GetpinghenData(char *str)
{  int i = 0, ret = 1;  int len = strlen(str);  for(i = 0; i < len; i++)  {  ret *= *(str + i) - '0';  }  return ret;
}


int main()
{  int data;  cin >> data;  char str[25] = {0};  char str1[25] = {0};  char str2[25] = {0};  itoa(data, str, 10); /* 这个函数会说没定义*/  int i = 0, len = strlen(str);  for(i = 0; i < len-1; i++)  {  strcpy(str1, str);  str1[i+1] = 0;  strcpy(str2, str + i + 1);  if(GetpinghenData(str1) == GetpinghenData(str2))  {  cout << "Yes" << endl;  return 0;  }  }  cout << "No" << endl;  return 0;
}

public class Main {
    public static void main(String[] args) {
        java.util.Scanner in = new java.util.Scanner(System.in);
        String str = in.nextLine();
        if (str == null || str.length() == 0) {
            System.out.println("请输入参数");
            return;
        }
        System.out.println(isBalance(str) ? "YES" : "NO");
    }
    private static boolean isBalance(String num) {
        if (num.length() < 2) {
            return false;
        }
        //检测0，如果一个0，为false；如果多个0，为true
        int firstZero = num.indexOf('0');
        if (firstZero > -1) {
            int lastZero = num.lastIndexOf('0');
            if (firstZero == lastZero) {
                return false;
            } else {
                return true;
            }
        }
        //左右两边计算乘积，值小的一方移位
        char[] arr = num.toCharArray();
        int left = 0, right = arr.length - 1, leftv = arr[left] - 48, rightv = arr[right] - 48;
        while (left < right - 1) {
            if (leftv <= rightv) {
                leftv *= arr[++left] - 48;
            } else {
                rightv *= arr[--right] - 48;
            }
        }
        return leftv == rightv;
    }
}

public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    String num=sc.next();
    int a[]=new int[num.length()];
    for(int i=0;i<num.length();i++){
        a[i]=Integer.parseInt(String.valueOf(num.charAt(i)));
    }
    boolean key=false;
    int mul1=1,mul2=1;
    for(int i=0;i<a.length;i++){
        for(int k=i;k>=0;k--){
            mul1*=a[k];
        }
        for(int j=i;j<a.length-1;j++){
            mul2*=a[j+1];
        }
        if(mul1==mul2){
            key=true;
        }
        }
    if(key){
        System.out.println("YES");
    }else{
        System.out.println("NO");
    }
}